Twentyseven 1.0.0: A 12-Year Haskell Odyssey in Rubik's Cube Solving

After twelve years of development, a Haskell-based Rubik's Cube solver, Twentyseven, has reached version 1.0.0. Inspired by Herbert Kociemba's Cube Explorer, it uses Iterative Deepening A* (IDA*) search, cleverly projecting the cube state into simpler subproblems to estimate remaining moves and find optimal solutions. While optimal solutions can take hours, the author also discusses Kociemba's faster two-phase algorithm for near-instantaneous solutions. This release primarily focuses on GHC compiler compatibility and code maintenance.