On Thu, Nov 22, 2007 at 08:47:47PM -0500, Don Dailey wrote: > Fritz had this and the programmer often joked that the bottleneck in his > program was those expensive memory references (referring to the piece > square tables that made his program so fast.) His program was so fast > that you could almost believe this was true.
He may have been right about that! I just read Ulrich Dreppers article "What Every Programmer Should Know About Memory" at http://lwn.net/Articles/250967/ It points out that on modern PC hardware, if the processor has to go all the way to the main memory to fetch a biece of data, it can cost more than a thousand instructions! Luckily this is a rare occurrence, the caches are pretty effective. But something to think about, I suppose, at least with large UCT trees and transposition tables... -Heikki -- Heikki Levanto "In Murphy We Turst" heikki (at) lsd (dot) dk _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
