Search in the Eights Puzzle
Are the hard wired methods effective?
- Breadth-first very poor except for very easy problems
- Depth-first useful without loop checking
- not much good with it, either
- Depth-bounded -- how do we choose depth bound?
- Iterative deepening ok
- and we can use increment = 2 (why?)
- still need good heuristics for move choice