On 12-aug-08, at 10:40, Gian-Carlo Pascutto wrote:
On Tue, 2008-08-12 at 09:15 +0200, Gian-Carlo Pascutto wrote:
Aside from that, it's not theorethically necessary for alpha-beta
to do
wasted work (although it will in practise), and more CPUs can
make the
program worse on any practical architecture (mostly due to
locking and
memory bandwidth).
What??? I think you need to catch up on theory. A parallel
alpha beat
searcher will always do some extra work that a serial searcher
won't do.
You cannot expect to get a 10X speedup with 10x more processors.
Even in the theorethical case of a perfectly ordered game tree?
Well... no. Because if you have a perfectly ordered tree, in theory,
you don't need to search at all. And if you don't need to search it
will also not be able to speed up 10x.
But we're getting rather philosophical that way.
Mark
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
