Document Type

Conference Proceeding

Publication Date



Many computing problems can be solved by identifying all possible moves or combinations of events and then picking the best solution. Problems in this domain provide fertile ground for exploring problem representation, storage requirements, and computational complexity. The problems and solution approaches are easy to understand, yet quickly push the memory and storage limits of a personal computer. This paper describes insights from a preliminary investigating of two exhaustive search problems, the 15-puzzle and Rubik’s cube. The insights gained by looking at exhaustive search problems can be integrated into classroom discussions and projects.


To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.