Fundamentals of Computer Science II (CSC-152 2000S)


Class 40: Automated Problem Solving with Linear Structures

Back to Priority Queues, Heaps, and Heap Sort. On to Dictionaries and Binary Search Trees.

Held Tuesday, May 2, 2000

Overview

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

Notes

Contents

Summary


Heaps, Revisited

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, 18 January 2000

Friday, 14 April 2000

Back to Priority Queues, Heaps, and Heap Sort. On to Dictionaries and Binary Search Trees.


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/2000S/Outlines/outline.40.html

Source text last modified Fri Apr 14 09:43:05 2000.

This page generated on Fri Apr 14 10:56:28 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu