Skip to content
move generator experiments on gpu
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
moderngpu-master
.gitattributes created new project for gpu perft experiments Apr 28, 2013
.gitignore
GlobalVars.cpp clean up old/slower perft routines Jul 24, 2016
InfInt.h add support for > 64 bit perfts Aug 2, 2016
LICENSE Create LICENSE Aug 7, 2018
Magics.cpp
Makefile
MoveGeneratorBitboard.h
README
UciInterface.cpp created new project for gpu perft experiments Apr 28, 2013
chess.h
launcher.h fix network related bugs for multi-node perft Aug 10, 2017
network.cpp
perft.cu
perft14.txt try complete hashing at last CPU level Sep 9, 2016
perft14_run4.txt
perft15_run3_1.7z upload perft(15) full results Dec 24, 2017
perft15_run3_2.7z
perft_bb.h fix for complete hash mode + minor fixes to run on linux again Jul 24, 2017
perft_gpu.sln
perft_gpu.vcxproj Volta Tuning May 19, 2017
randoms.cpp
switches.h timer fix and gpu time measurement Jul 25, 2017
util.cpp
utils.h

README

gpu chess move generation / perft experiments 

- Move generation uses bitboards
-- position represented using a set of 6 bitboards
-- two variations for sliding piece move generation: kogge-stone and magics
--- three variations of magics: plain, fixed shift fancy, and byte-lookup fancy
--- table sizes: 2.3 MB, 760KB, 150KB respectively.
-- kogge stone faster in some cases and fixed shift fancy faster in some

- perft routine can work with or without transposition table support

- peak speeds on overclocked GTX 780:

-- without transposition tables: 
--- 27 Billion moves per second (pos2 of cpw)
--- 16 Billion moves per second (starting pos)
--- 1.5 hours for perft(10) of start position

-- with transposition tables:
--- start position perft(11) in 1 hour!

You can’t perform that action at this time.