This interactive Python project uses the turtle graphics module to simulate a colorful racing game between multiple turtles. Players choose the number of racers (2–10), and each turtle moves forward by random distances as it competes to reach the finish line first. Randomly placed obstacles on the track slow down or stop racers, adding an element of unpredictability and strategy.
This visualization compares Breadth-First Search (BFS) and Depth-First Search (DFS) in maze traversal. Each algorithm explores the maze differently — BFS finds the shortest path layer by layer, while DFS dives deep before backtracking. Both are implemented in Python and animated using the curses library.