| Current Forum: Homework 6 - Part II |
| Date: Fri Dec 7 2001 2:48 pm |
| Author: Maxim, Michael G. <mmaxim@andrew.cmu.edu> |
| Subject: Re: searching in order of expected goodness |
|
|
Giancarlo,
Yes this is an option. The key is to get the best move searched first, and for this using the "killer table" strategy that was introduced on the quiz is a good idea. There are many ways to do this, and running the evaluation function is a good start.
Mike |
|