-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathAnalyzerTests.py
More file actions
133 lines (116 loc) · 4 KB
/
AnalyzerTests.py
File metadata and controls
133 lines (116 loc) · 4 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
from Analyzer import Analyzer
from Board import Board
def test_capture():
print("testing simple capture and advance")
print("\tsimple choice white")
b = Board()
b.board = [[0, 0, 0, 0, 0, 0, 0, -999],
[0, 0, 0, 0, 0, 0, 0, 0],
[0, 1, 0, 0, 0, 0, 0, 0],
[-1, 0, -3, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 999]]
a = Analyzer()
a.sd_limit = 2
res = a.minimax(b, 20)
assert(res.move == ((2, 1), (3, 2)))
print("\tsimple choice black")
b = Board()
b.turn = -1
b.board = [[0, 0, 0, 0, 0, 0, 0, 999],
[0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0],
[1, 0, 3, 0, 0, 0, 0, 0],
[0, -1, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, -999]]
# a = Analyzer(20)
a.sd_limit = 2
res = a.minimax(b, 20)
assert(res.move == ((4, 1), (3, 2)))
def print_move_chain(analyzer, board, move):
while move:
print board
print "score: " + str(analyzer.score(board)) + ", next: " + str(move.move) + \
" " + str(move.value)
board = board.apply_move(move.move)
move = move.next
def test_endgame_heuristics():
a = Analyzer()
b = Board()
b.board = [[0, 5, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 999, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0],
[5, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, -999]]
res = a.minimax(b, 200)
print_move_chain(a, b, res)
b = Board()
b.turn = -1
b.board = [[0, -5, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, -999, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0],
[-5, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 999]]
res = a.minimax(b, 200)
print_move_chain(a, b, res)
def test_scenarios():
# some puzzles from Reinfeld's Chess Tactics for Beginners
print("testing move pruning")
a = Analyzer()
a.sd_limit = 4
print("\tPuzzle #21")
b = Board()
b.board = [[0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0],
[0, -1, 9, 0, 0, 0, 0, 0],
[0, 0, 0, 0, -999, -1, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 999],
[0, 0, 0, 0, 0, 0, 0, -1],
[0, 0, 0, 0, 0, 0, 0, 0],
[-9, 0, 0, 0, 3, 0, 0, 0]]
res = a.minimax(b, 100)
print_move_chain(a, b, res)
assert(res.move == ((7,4),(5,3)))
# todo - pawn promotion is required for this one!
# print("\tPuzzle #23")
# b = Board()
# b.turn = -1
# b.board = [[0, 0, 0, 0, 0, 0, 0, 0],
# [0, 0, 999, 0, 0, 0, 0, -1],
# [-5, 0, 0, 0, 0, 0, 0, 0],
# [0, 0, 0, 0, 0, 0, 0, 0],
# [0, 0, 0, 0, 0, 0, 0, 0],
# [0, 0, 0, 0, 0, 0, 0, 0],
# [0, 0, 0, 0, 0, -999, 0, 0],
# [0, 0, 0, 0, 0, 0, 0, 5]]
# res = a.minimax(b)
# print_move_chain(b, res)
print("\tPuzzle 52")
b = Board()
b.turn = -1
b.board = [[0, 0, 5, 0, 0, 0, 999, 0],
[0, 0, 0, 0, 0, 1, 1, 1],
[1, 0, 0, -9, 0, 0, 0, 0],
[0, 1, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0],
[-1, -1, 0, 0, 0, 0, 0, -1],
[0, 0, 9, 0, 0, -1, -1, 0],
[0, 0, 0, -5, 0, 0, -999, 0]]
res = a.minimax(b, 100)
print_move_chain(a, b, res)
def main():
test_capture()
test_endgame_heuristics()
test_scenarios()
if __name__ == "__main__":
main()