Bloxorz AI Solver

Console Bloxorz puzzle game with BFS, DFS and A* solvers, plus a Tkinter GUI. NOVA IMS course project, 4-person team.

Three search strategies solve the same levels, so their behaviour can be compared side by side.

Python
algorithms
search

Problem

Bloxorz is a rolling-block puzzle with a small but tricky state space: a natural test bed for search algorithms.

Approach

Modelled the block’s position and orientation as a state and its rolls as transitions. Implemented breadth-first, depth-first and A* search over that graph. Built both a terminal game and a Tkinter GUI.

Result

An interactive game that can also solve itself. BFS finds shortest solutions, DFS shows the cost of not searching in layers, and A* reaches the goal while expanding fewer states.