#

maze-solving

A maze is a type of puzzle involving a collection of paths, usually where a player has to find a route from start to finish.

A huge variety of algorithms exist for generating and solving mazes. These are not only fun to implement, but also are a good way to familiarise yourself with programming techniques, algorithms, and languages.

Here are 2 public repositories matching this topic...

himanshu9084 / E0-251-Data-Structures-and-Algorithms

E0 251 Data Structures and Algorithms course is offered by Department of Computer Science and automation, Indian Institute of Science, Bangalore. The assignment includes work on sparse data structures, large unsigned integer arithmetic, polynomial division, betweenness centrality using bfs and floyd warshall, persistent data structures, solving …

algorithms maze persistent data-structures persistent-data-structure sparse-matrix large-integers betweenness-centrality floyd-warshall sparse-matrices maze-solver maze-solving algorithms-course stack-maze

Updated May 7, 2020
C

PritK99 / MazeBlaze

Maze-solving bot

robotics esp32 maze line-following c-programming embedded-c pid-controller maze-solving shortest-path-algorithm line-following-robot

Updated Oct 28, 2023
C

Followers: 9 followers
Website: github.com/topics/maze
Wikipedia: Wikipedia

Related topics

algorithm game pathfinding search