Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Move ordering question

Author: Severi Salminen

Date: 04:54:56 01/05/02

Go up one level in this thread


>>The optimal solution is a movegenerator that allways generated the best move.
>
>I can't agree with your first sentence. What you really prefer very often is the
>good enough move that generates the smallest sub-tree as this is more efficient.
>Unless this what you mean by "best move", but I think most people would agree,
>that is an unusual interpretation of what is meant by "best move".

I meant that it really generates _the absolutely best move in this position_,
without searching. So it was a stupid late-night joke... But I don't understand
what you tried to say? Isn't it allways good to try the best move first as it
has the greatest posiibility to cause a cut off?? And I have only 1 way to
interprete what "the best move" means.

Severi



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.