Gold Search – Pygame AI Shortest path search algorithm

This is a simple game I developed using Pygame for my Artificial Intelligence Game Design class. The project demonstrates four different shortest path search algorithms:

• Breadth-first search
• Dijkstra’s algorithm
• A-star (A*) search algorithm
• Best-first search

In this Pygame project, the chosen shortest path search algorithm is used to determine the optimal route from point A (the Zombie) to point B (the nearest coin or gold).

Instructions

MOUSE:
Left-click = Add/Remove Coins
Right-click = Add/Remove Obstacles

KEYBOARD KEYS:
Level:
“+” key = Increase the obstacle chance.
“-” key = Decrease the obstacle chance.
“G” key = Rebuild the Level.

Search type:
“B” key = BREADTH-FIRST SEARCH
“D” key = DJIKSTRA SEARCH
“A” key = A-STAR SEARCH
“S” key = BEST-FIRST SEARCH