Rush Hour Solver

Rush Hour Puzzle Solver is an interactive web application that solves the classic Rush Hour puzzle using various search algorithms. The puzzle consists of a grid with vehicles of different sizes, where the goal is to move the red car to the exit by sliding other vehicles out of the way.

This application was developed as part of the Algorithm Strategy course at Institut Teknologi Bandung, demonstrating the practical application of search algorithms and heuristic functions in solving constraint satisfaction problems with interactive visualization and performance analysis.

Key Features

• Implemented multiple search algorithms including A*, Greedy Best-First, UCS, Dijkstra, and Fringe Search
• Developed three heuristic functions: Manhattan Distance, Blocking Vehicles, and Combined weighted approach
• Created interactive puzzle visualization with step-by-step solution playback and speed control
• Built performance analytics showing execution time, nodes explored, and solution path length
• Designed custom puzzle upload functionality and solution export to text files

Tech Stack