Python solver for Eternity II-style puzzles using a binary MILP model, PuLP/CBC and a Tkinter interface with fixed-piece hints.
-
Updated
Oct 16, 2026 - Python
Python solver for Eternity II-style puzzles using a binary MILP model, PuLP/CBC and a Tkinter interface with fixed-piece hints.
High-performance, distributed client-server solver for the Eternity II puzzle featuring GPU acceleration, distributed search coordination, and telemetry tracking.
Certified impossible placements in Eternity II under the five official clues, with reproducible SAT/DRAT certificates.
Solvers, records, and negative results for the never-solved gold challenge of the Diamond Dilemma (1988 prize puzzle): 142/160 tiles placed perfectly, 208/240 edges matched, and a documented map of every approach ( exhaustive C solver with CP-SAT oracle, large-neighbourhood optimizers,...)..
To associate your repository with the eternity-ii topic, visit your repo's landing page and select "manage topics."