| ©1990-2005 by Stewart T. Coffin For questions or comments regarding this site, contact the chief metagrobologist:  |
[Home] [Contents] [Figures] [Search] [Help]
[Next Page] [Prev Page] [ Next Chapter] [Prev Chapter]
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 geometrical puzzle, ideally all pieces are dissimilar and non-symmetrical, thus resulting in the maximum number of combinations for a given number of pieces. Maximum difficulty is achieved when only one correct combination exists. Since puzzles of this type can usually be made more difficult 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.
Regular Polygons as Building Blocks
Triangles as Building Blocks
Squares as Building Blocks
Pentominoes
More Checkerboards
The Cornucopia Puzzle
Hexagons as Building Blocks
| ©1990-2005 by Stewart T. Coffin For questions or comments regarding this site, contact the chief metagrobologist: |
[Next Page] [Prev Page] [ Next Chapter] [Prev Chapter]