The user created a complete database of every "interesting" starting position for the Rush Hour puzzle, which includes 2,577,412 puzzles covering 9,698,093,879 reachable states, and made the database available for download. The user's code uses bitboards, simulated annealing, and other techniques to efficiently generate and analyze the puzzles, and the user estimates that solving the 7x7 case ...