Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: A faster move generator than previously known

Author: Sune Fischer

Date: 05:58:58 08/08/03

Go up one level in this thread


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.
Not only do you save time in generation but also time on ordering them.

With bitboards you get this almost for free, but there are disadvantages.

Vincent has of course designed a test that emphasizes the disadvantages.

Then he says _I_ have not understood the point, ehmmm. :)

>It is unimportant to discuss about subjects that vincent talk about unless he
>apologizes about his bad behaviour.

He seems harmless to me, like a mosquito bite. ;)

-S.
>Uri



This page took 0.01 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.