Possible Search Algorithms for GPUs?

Discussion of chess software programming and technical issues.

Moderators: bob, hgm, Harvey Williamson

Forum rules
This textbox is used to restore diagrams posted with the [d] tag before the upgrade.
bob
Posts: 20643
Joined: Mon Feb 27, 2006 6:30 pm
Location: Birmingham, AL

Re: Possible Search Algorithms for GPUs? APHID

Post by bob » Thu Feb 16, 2012 12:08 am

smatovic wrote:My YBWC approach on the GPU def failed now, but i found another candidate:

APHID: Asynchronous Parallel Game-Tree Search by Mark G. Brockington and Jonathan Schaeffer

--
Srdja
That's certainly not a GPU methodology. That's a message-passing methodology that fits clusters. GPUs don't really fit that topology very well... The primary problem is that GPUs are designed to address the "data-parallelism" types of problems. That is not chess, thanks to alpha/beta's non-serial order of searching a tree.

smatovic
Posts: 964
Joined: Wed Mar 10, 2010 9:18 pm
Location: Hamburg, Germany
Full name: Srdja Matovic
Contact:

Re: Possible Search Algorithms for GPUs? new gpus

Post by smatovic » Mon Feb 20, 2012 6:25 pm

The 7770 and 7750 are right around the corner Smile They are more reasonably priced.
...and the AMD HD 78xx series will be released in March,

the 7850 is going to have 1280 Cores on die equipped with up to 2 GB with an 256 bit memory interface...that one sounds like an good update for me.

--
Srdja

smatovic
Posts: 964
Joined: Wed Mar 10, 2010 9:18 pm
Location: Hamburg, Germany
Full name: Srdja Matovic
Contact:

Re: Possible Search Algorithms for GPUs?

Post by smatovic » Wed Feb 29, 2012 3:50 pm

...i didnt get how the RBFM does his child selection....so i will try the familiar B* as next.

--
Srdja

Post Reply