Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: A faster move generator than previously known

Author: Uri Blass

Date: 06:30:15 08/08/03

Go up one level in this thread


On August 08, 2003 at 08:58:58, Sune Fischer wrote:

>On August 08, 2003 at 08:43:49, Uri Blass wrote:
>>>
>>>That move generation tests are silly, because they compare apples to organges?
>>
>>Did not you learn that it is better to ignore everything that vincent say?
>>He attacks personally people who disagree with him so it is better to say
>>nothing if you disagree with him.
>
>yeah you gotta love him :)
>
>>My post was not about the importance of the tests but a simple question to sune.
>>Sune said that he is using incremental move generator and I simply asked what he
>>exactly means by it.
>
>Well you already seemed to have understood it :)
>The problem is, that in a typical position you have ~40 moves.
>
>Now it is a waste of time to generate all 40 moves, then do move ordering on 40
>moves, only to fail high on the first one you search.
>
>So, the idea is to generate high probablity cutoff moves and search those first.

It may be right for hash table moves,good captures and killer moves but
after you generate them you need to generate the rest of the moves and if you do
not generate all of them then you reduce the probability to fail high.

My question was if your move generator generates only one move at a time
including trying to generate illegal killer moves or if it generates sets of
moves like captures and other moves.

Today I generate always all moves(I plan to do better by generating captures and
count legal moves and generate rest but it is not a simple task for movei
because I do not want to write something only to delete it later for something
faster).

Uri



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.