Computer Chess Club Archives

Search

Messages

Subject: Re: root search ordening

Author: Charles Williams

Date: 08:50:00 05/02/01

Go up one level in this thread

>
>I also use nodecounts after reading about it on CCC. But what type do you use
>for the counter, an unsigned int? That will overflow after a search of a couple
>of hours on these 1M node/s machines we have nowadays, wouldn't it? Or am I
>missing something (like a shift right)?
>
>Groetjes,
>Paul


Why not use a bitboard?  It would take thousands of years to overflow it.


Chuck

• Re: root search ordening Paul 08:53:52 05/02/01
• Re: root search ordening Gian-Carlo Pascutto 08:53:40 05/02/01
  • Re: root search ordening Charles Williams 08:59:59 05/02/01

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.