The solver implements well known algorithms:
- standard Breadth-First Search
- Disk-Based Frontier Searh
- Two-Bit Breadth-Frst Search
and new algorithms:
- Optimized Frontier Search
- Three-Bit Breadth-First Search
All algorithms can be given an implementation of an abstract class Puzzle
New algorithms incorporate various optimizations:
- data compression
- GPU acceleration
- low-level bit tricks
For some puzzles, an optimized version of corresponding algorithms is created, with more domain-specific optimizations.
On my computer, running times are the following:
- Fifteen Sliding-Tile Puzzle: 40 hours
- Fifteen Pancakes Problem: 62 hours
- Four-Peg Towers of Hanoi Puzzle with 24 disks: 163 hours
Minimum requirements:
- NVidia GPU card
- 8TB free disk space
- 16GB RAM
- MIT license
- Copyright 2023 © lightln2