Programmable puzzles
Barry R. Clarke · 2023
In puzzles where the method of exhaustion is required to arrive at the solution, a computer program can save a lot of systematic checking. It is the extent to which the checking of possibilities is required that has determined whether or not a puzzle merits inclusion in this section. The emphasis here is on how to formulate the conditions in such a way that a computer program can execute an exhaustive check. There are puzzles in other chapters that also demand this method but the possibilities can easily be narrowed by the conditions to a manageable set. The author has checked the solutions using a version of Liberty BASIC that was developed by Carl Gundel in 1991.