GitHub - sliedes/pawnsonly: A solver for pawns-only chess variant

sliedes / pawnsonly Public

Notifications You must be signed in to change notification settings
Fork 0
Star 3

A solver for pawns-only chess variant

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 39 Commits
.gitignore		.gitignore
COPYING		COPYING
Makefile		Makefile
MemTranspositionTable.hpp		MemTranspositionTable.hpp
README		README
TranspositionTable.hpp		TranspositionTable.hpp
atomic_bench.cpp		atomic_bench.cpp
binom.cpp		binom.cpp
binom.hpp		binom.hpp
count.py		count.py
pawnsonly.cpp		pawnsonly.cpp

Repository files navigation

A solver for the pawns-only chess variant described in:

   http://www.chesscorner.com/tutorial/basic/pawngame/pawngame.htm

Expect to need quite a bit of memory (tunable by changing
TP_TABLE_SIZE in pawnsonly.cpp).

Without en passant, the game would be a draw. With en passant, it
turns out 1. b4/c4/f4/g4 are winning moves for white; all other moves
are wins for black.