Author: Jay Scott
Date: 11:41:50 11/29/97
Go up one level in this thread
On November 28, 1997 at 07:45:32, Chris Whittington wrote: >But I still make the point; the design compromise made to be bitmapped >ot offseted is going to have major consequences for the knowledge/speed >decision. The two choices of data structure, offset or bitmap, are mathematically isomorphic but have radically different efficiency characteristics on the scale of machine instructions and inner loops. Everyone agrees so far, right? Here you're trying to draw a conclusion about knowledge versus search, a broad-brush overall-architecture kind of thing, based on what machine instructions and inner loops you think each kind of program will end up with. Yow, that's too big a jump for me! Sure, the micro- architecture must affect the macro-architecture, but there are way too many cross-connections to understand them all ahead of time. You'd have to be superhuman to draw a conclusion like that without deep expertise in both data structures. Jay
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.