PhD thesis of Damian Sulewski:
https://eldorado.tu-dortmund.de/dspace/ ... tation.pdf
In chapters 12-15, re-solving Nine Men's Morris is described.
link to paper on solving games on the GPU
Moderators: hgm, Rebel, chrisw
-
Rein Halbersma
- Posts: 741
- Joined: Tue May 22, 2007 11:13 am
-
johnhamlen
- Posts: 25
- Joined: Sat Feb 18, 2012 10:56 am
- Location: United Kingdom
Re: link to paper on solving games on the GPU
Interesting, helpful, and well-timed. Thanks for posting Rein, and congratulations to Damian for finishing the work.
-
smatovic
- Posts: 2658
- Joined: Wed Mar 10, 2010 10:18 pm
- Location: Hamburg, Germany
- Full name: Srdja Matovic
Re: link to paper on solving games on the GPU
Yep, thanks to Rein and congratulations to Damian.
...but i am not sure if an Breadth-First-Search is possible for chess with depths greater seven.
--
Srdja
...but i am not sure if an Breadth-First-Search is possible for chess with depths greater seven.
--
Srdja
-
Daniel Shawul
- Posts: 4185
- Joined: Tue Mar 14, 2006 11:34 am
- Location: Ethiopia
Re: link to paper on solving games on the GPU
Hate to be the "killjoy" but this is irrelevant for our efforts here. It is totally done on disk which is slow as hell. SSD or HDD doesn't matter much in that regard. It may be good for prooving simple games by going through the state space systematically but no algorithm is mentioned for doing real time search with prunings and other stuff. I read only a summary from a paper extracted from the thesis,so there can be something else in the phd thesis...