A Java grid-based puzzle game where players rotate tiles to power all pieces through the power source
This project combines the use of Kruskal's Algorithm and Union-Find to generate minimum-spanning trees to generate procedural boards of any size. The maze is confirmed to be solvable using BFS with queue-based traversal.
