Kenken puzzle game can be represented as constraint satisfaction problem.
In this repo we solve this problem using 3 algorithms :
- Backtracking
- Backtracking with forward checking
- Backtracking with arc consistency
Clone the project
git clone https://github.com/MohamedAhmed412000/Kenken-Puzzle-SolverInstall dependencies
pip install pygame==2.1.2
pip install PyQt5==5.15.6Start the game
python main.py
- Choose the type of solver (User or Auto)
- Choose the algorithm (BT or FC or MAC)
- Choose the size of board (available from 3*3 to 7*7)
- Click on (Run Algorithm, GUI) button
- The game will be appeared with the solution.
- Also the user can play the game
Time analysis in seconds on 100 boards for different sizes on the 3 algorithms.
- BT : backtracking
- FC : backtracking with forward checking
- AC : backtracking with arc consistency
| size | BT | FC | AC |
|---|---|---|---|
| 3 * 3 | 0.284 | 0.3398 | 0.6377 |
| 4 * 4 | 2.9063 | 2.531 | 4.9756 |
| 5 * 5 | 41.003 | 14.927 | 39.132 |