stanford-cs-221-artificial-intelligence
VIP cheatsheets for Stanford's CS 221 Artificial Intelligence
- 3k
- MIT
- 7 y ago
VIP cheatsheets for Stanford's CS 221 Artificial Intelligence
BFS, Greedy Best-First Search, Dijkstra and A* path finding algorithms
Search-based decoder for quantum error correction (QEC) written in C++ and Python.
Dijkstra's Shortest Path for 6, 18, and 26-Connected 3D (Volumetric) Image Volumes
Java Code for Contraction Hierarchies Algorithm, A-Star Algorithm and Bidirectional Dijkstra Algorithm. Tested and Verified Code.
Swift implementation of the Sliding Puzzle game with Iterative Deepening A* AI Solver.
Pathfinding and navigation for GameMaker. Resumable A*, flow fields, cost fields, clearance, isometric and hex grids, platformer jump arcs. Pure GML.
🚀 Interactive pathfinding app using React, Deck.gl, and MapLibre for visualizing routes and geospatial data.
Algorithms and Data Structures a comprehensive collection of fundamental Algorithms and Data structures organized into various categories to cater to the needs of software engineers and computer science students.
Implementation of the A Star Search Algorithm in C++ and QT to find the shortest path between two positions.
Smart warehouse digital twin with autonomous forklifts and XAI — Robotics & AI 2, MSc @ UniPA 2025
🌐 A web-based interface for running Multiple Sequence Alignment (MSA) using A-Star and PA-Star algorithms.
A* pathfinding on hexagonal grids — university project for Algoritmi e Principi dell'Informatica