Author: Dan Andersson

Date: 01:00:20 11/20/02

Go up one level in this thread

>Actually, at least for the case of Crafty and Yace, there is a good basis for >comparison. They are relatively equal in playing strength. So any advantage in >bitboards over arrays or vice-versa would seem to be _very_ minimal, which is >what I have generally claimed for 32 bit machines... > The problem with that position are many. But one fundamental flaw is that they may use different extension and pruning conditions. Thus they might look at trees that are wildly different. And the rough equality of playing strength may have no more than a tangential relation with whatever data representation is used. MvH Dan Andersson

- Re: significant math
**Robert Hyatt***07:59:33 11/20/02*- Re: significant math
**Dan Andersson***13:52:11 11/20/02*- Re: significant math
**Robert Hyatt***15:34:35 11/20/02* - Re: significant math
**Sune Fischer***14:37:08 11/20/02*- Re: significant math
**Vincent Diepeveen***21:00:13 11/21/02*- Re: significant math
**Sune Fischer***03:24:41 11/22/02*

- Re: significant math

- Re: significant math

- Re: significant math

- Re: significant math

This page took 0.1 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

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