CS100A Lecture 17

10/26/99

Click here to start

Table of Contents

CS100A Lecture 17

Knight’s Tour

Possible Solution

Representation

Main

Initialize

Solve

Display

Sample Intermediate State

Solve

Better Solve

Choosing a Neighbor to Visit

Neighbors

Boundary Conditions

Representation Revisited

Improvement Using Heuristic

Unvisited

Author: Tim Teitelbaum

Download presentation source