ABSTRACT
Data compression is often blind to the meaning of the data and instead depends on detecting pure, context-free patterns. It is possible, however, to exploit the structured nature of the data to achieve extremely efficient compression. Klondike Solitaire is probably the world's most popular solitaire game. Given that runtime puzzle generation was not an option, designers set out to create a database of graded puzzles for Klondike. Generation of a good plausibility ordering, in which the early moves are the most likely, is a critical topic. This point was illustrated by the recent success of AlphaGo. A good plausibility ordering, combined with the interest search mechanism, allowed Shotest to quickly enter the top rankings in Computer Shogi, even though it was authored by a programmer who played a poor game of Shogi! Even a slightly better ordering resulted in a much more efficient and effective tree search.
