NxM puzzle solver using graph traversal algorithms
AUT Data Structure Projects
A Java implementation of Graph Search with heuristics for N-Puzzle problem
A program to simulate a simpler version of Coyote and the Road Runner’s world. Created an environment for the Road Runner to run wild making sure that she gets to her destination as fast as possible while avoiding the Coyote and his complex contraption.
A program that can solve any maze using DFS, BFS or A* search algorithms. Applies Genetic Algorithm to generate difficult yet solvable maze
Add a description, image, and links to the graph-search-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the graph-search-algorithms topic, visit your repo's landing page and select "manage topics."