Computer Chess Club Archives


Search

Terms

Messages

Subject: Quad proc results

Author: Tom Kerrigan

Date: 03:21:49 05/01/04


I got access to a quad proc computer this evening and timed how long it took to
search the BK positions to 10 ply, varying the # of threads. Here's the result.

threads   time(s)   NPS(k)   time             NPS     search efficiency
1         943       206      -                -       100%
2         585       401      1.61x (as fast)  1.94x   82%
3         414       569      2.27x            2.76x   82%
4         365       742      2.58x            3.60x   71%

I was wondering how this compares to other programs. My program uses a simple
implementation of YBW, which I found to perform significantly better than
ABDADA. (The latter seems to perform fine until you turn on null move.)

I recall most algorithms in the ICCA Journal claiming excellent scaling for
4-way, usually over 3x IIRC. So I'm a little disappointed by 2.58x but I wonder
how other people measure speedups. Is it with null move on? Also, the set of
positions makes a huge difference. On 11 of the BK positions I get > 3x but the
overall average is dragged down by a few < 2x positions that take a long time to
search.

-Tom



This page took 0.04 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.