Iwahswap
A puzzle developed in a creative exchange between Iwahiro (Hirokazu Iwasawa), Goetz Schwandtner, Bram Cohen and Oscar van Deventer.
Said to have a hyper-exponential number of moves for n pieces to solve.
Play Iwahswap
Hanoi Tower
The classic Tower of Hanoi puzzle with 6 disks. Move all disks from the first tower to the last,
following the rule that larger disks cannot be placed on smaller ones.
Play Hanoi Tower
Framework Features
🧩 Abstract Architecture
Modular design with AbstractGame and AbstractRenderer base classes for easy puzzle extension
🔍 BFS Solver
Breadth-first search algorithm explores the state space and finds optimal solutions
📊 Graph Visualization
Interactive force-directed graph showing state transitions with physics simulation
📖 Add Your Puzzle
Learn how to extend the framework with your own puzzle implementation