ABSTRACT
A combinatorial problem (puzzle) is one in which various elements (pieces) can be combined (assembled) many different ways, only a few of which are the desired result (solution). The success or lack of it for any attempt at solution may not become apparent until most of the pieces are in place. For a geometric puzzle, ideally all pieces are dissimilar and nonsymmetrical, thus resulting in the maximum number of combinations for a given number of pieces. Maximum diffi culty is achieved when only one correct combination exists. Since puzzles of this type can usually be made more diffi cult simply by increasing the number of pieces, the challenge facing the puzzle designer is to cleverly devise simple puzzles of this sort having few pieces while yet being intriguing and puzzling. In this chapter, we will introduce the subject by considering some simple two-dimensional combinatorial puzzles.
