6.034 Artificial Intelligence - Recitations, fall 2004 online slides on search
|
|
|
Next: Sample Search Problems Previous: Sample Search Problems
Sample Search Problems
Towers of Hanoi problem
States: combinations of poles and disks
Operators: move disk x from pole y to pole z subject to constraints
Goal test: disks from smallest to largest on goal pole
Path cost: 1 per move
