Implemented four search algorithms as Pacman agents: Breadth-First Search (finds shortest-hop path), Depth-First Search (memory-efficient), Uniform Cost Search (optimal for weighted graphs), and A* ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results