| Current Forum: Homework 6 - Part II |
| Date: Fri Dec 7 2001 1:33 pm |
| Author: Dozzi, Giancarlo <gdozzi@andrew.cmu.edu> |
| Subject: searching in order of expected goodness |
|
|
| In lecture, the concept of searching the possible moves in order of probable goodness was introduced. Is this done simply by using the estimator function on every possible move, and then sorting the results? (In addition, the estimator function would get used again once the maximum recursion depth is hit) |
|