Add perft tests with nodes and counts
All checks were successful
Python tests (make) / test (push) Successful in 11s
Python tests (make) / test (pull_request) Successful in 12s

This commit is contained in:
2025-08-19 18:32:15 -04:00
parent 44b183bc4d
commit 0c6639a215

View File

@@ -1,33 +1,90 @@
from test.base import ChessLibTestBase from test.base import ChessLibTestBase
from test.chess_ffi import Board, perft from test.chess_ffi import Board
from test.chess_ffi import perft
class TestPerft(ChessLibTestBase): class TestPerftQuick(ChessLibTestBase):
def test_start_position(self): def test_perft_1(self):
b = Board() b = Board()
self.load_fen("rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1", board=b) self.load_fen("rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1", board=b)
expected = { node_count = {
1: 20, 1: 20,
2: 400, 2: 400,
3: 8902, 3: 8902,
#4: 197281, 4: 197281,
# 5: 4865609, 5: 4865609,
# 6: 119060324
} }
for d, want in expected.items(): for node, count in node_count.items():
got = int(perft(b, d)) actual = int(perft(b, node))
self.assertEqual(got, want, f"perft({d}) start pos") self.assertEqual(count, actual, f"perft({node}) start pos")
"""
def test_kiwipete(self): def test_perft_2(self):
b = Board() b = Board()
self.load_fen("r3k2r/p1ppqpb1/bn2pnp1/3PN3/1p2P3/2N2Q1p/PPPBBPPP/R3K2R w KQkq - 0 1", board=b) self.load_fen("r3k2r/p1ppqpb1/bn2pnp1/3PN3/1p2P3/2N2Q1p/PPPBBPPP/R3K2R w KQkq - 0 1", board=b)
expected = { node_count = {
1: 48, 1: 48,
2: 2039, 2: 2039,
3: 97862 3: 97862,
4: 4085603,
} }
for d, want in expected.items(): for node, count in node_count.items():
got = int(perft(b, d)) actual = int(perft(b, node))
self.assertEqual(got, want, f"perft({d}) kiwipete") self.assertEqual(count, actual, f"perft({node}) start pos")
"""
def test_perft_3(self):
b = Board()
self.load_fen("8/2p5/3p4/KP5r/1R3p1k/8/4P1P1/8 w - - 0 1", board=b)
node_count = {
1: 14,
2: 191,
3: 2812,
4: 43238,
5: 674624,
}
for node, count in node_count.items():
actual = int(perft(b, node))
self.assertEqual(count, actual, f"perft({node}) start pos")
def test_perft_4(self):
b = Board()
self.load_fen("r3k2r/Pppp1ppp/1b3nbN/nP6/BBP1P3/q4N2/Pp1P2PP/R2Q1RK1 w kq - 0 1", board=b)
node_count = {
1: 6,
2: 264,
3: 9467,
4: 422333,
}
for node, count in node_count.items():
actual = int(perft(b, node))
self.assertEqual(count, actual, f"perft({node}) start pos")
def test_perft_5(self):
b = Board()
self.load_fen("rnbq1k1r/pp1Pbppp/2p5/8/2B5/8/PPP1NnPP/RNBQK2R w KQ - 1 8 ", board=b)
node_count = {
1: 44,
2: 1486,
3: 62379,
4: 2103487,
}
for node, count in node_count.items():
actual = int(perft(b, node))
self.assertEqual(count, actual, f"perft({node}) start pos")
def test_perft_6(self):
b = Board()
self.load_fen("r4rk1/1pp1qppp/p1np1n2/2b1p1B1/2B1P1b1/P1NP1N2/1PP1QPPP/R4RK1 w - - 0 10 ", board=b)
node_count = {
1: 46,
2: 2079,
3: 89890,
4: 3894594,
}
for node, count in node_count.items():
actual = int(perft(b, node))
self.assertEqual(count, actual, f"perft({node}) start pos")