Fundamentals of Computer Science II (CSC-152 99F)


Class 38: Linear Structures for Solving Puzzles

Back to Heaps and Heap Sort. On to Stack Lab.

Held Friday, November 5, 1999

Overview

Today, we'll visit an application of stacks and queues: automated puzzle solving. Along the way, we'll consider some object-oriented design issues.

Notes

Contents

Summary


Puzzles

The Eights Puzzle

Mazes

A Coins Puzzle

Modeling Puzzles

Implementing Puzzles

Solving Puzzles

Selecting a Linear Structure

Using Queus for Solving

Using Stacks for Solving


History

Tuesday, 10 August 1999

Thursday, 4 November 1999

Back to Heaps and Heap Sort. On to Stack Lab.


Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.

This page may be found at http://www.math.grin.edu/~rebelsky/Courses/CS152/99F/Outlines/outline.38.html

Source text last modified Thu Nov 4 21:11:33 1999.

This page generated on Thu Nov 4 21:14:41 1999 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu