Klotski Otimizado

Klotski puzzle solver written in C with optimized breadth-first search, state hashing and compact data structures to explore millions of positions per second.

Case study

• Compact board-state representation to reduce memory usage
• State deduplication via hashing, pruning the search space
• Iterated through 5 optimization versions, each measured and compared

Stack