-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathchessEncoder.py
272 lines (267 loc) · 7.38 KB
/
chessEncoder.py
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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
# This program is a Python program that can accept a file and encode the file into chess games using the PGN file format
# This program was created for educational purposes for a Computer Forensics project at California State University, Sacramento.
# Date Last Modified: 04 May 2018
import chess
import chess.pgn
import random
import names
import math
import binascii
from bitstring import BitArray
import sys
sys.setrecursionlimit(1500)
fh1 = open("testGames.pgn","w")
filename = 'testDoc.txt'
x = 1
with open(filename, "rb") as f:
byte = f.read(1)
while byte != b'':
# Do stuff with byte.
game = chess.pgn.Game()
game.headers["Event"] = "Daily Tournament"
game.headers["Date"] = "2018.04.06"
game.headers["Round"] = x
game.headers["White"] = names.get_first_name()
game.headers["Black"] = names.get_first_name()
board = chess.Board()
white_last = True
black_last = True
#White to move
l = str(board.legal_moves)
i = l.split("(")
l = i[1]
i = l.split(")")
l = i[0]
my_list = l.split(", ")
num_moves = len(my_list)
if num_moves > 2:
num_bits = math.floor(math.log(num_moves,2))
else:
num_bits = 1
binary = bin(int(binascii.hexlify(byte), 16))[2:].zfill(8)
b = binary[:num_bits]
move = int(str(b),2)
next_move = str(my_list[move])
s = str(board.push_san(next_move))
node = game.add_variation(chess.Move.from_uci(s))
prev_move_white = next_move
prev_num_bits = num_bits
#Black to Move
l = str(board.legal_moves)
i = l.split("(")
l = i[1]
i = l.split(")")
l = i[0]
my_list = l.split(", ")
num_moves = len(my_list)
if num_moves > 2:
num_bits = math.floor(math.log(num_moves,2))
else:
num_bits = 1
if((prev_num_bits + num_bits) <= 8):
if num_bits > 1:
if byte == b'':
break;
binary = bin(int(binascii.hexlify(byte), 16))[2:].zfill(8)
b = binary
b = b[prev_num_bits: prev_num_bits + num_bits]
move = int(str(b),2)
prev_num_bits += num_bits
else:
move = 0
next_move = str(my_list[move])
prev_move_black = next_move
if prev_num_bits == 8:
byte = f.read(1)
prev_num_bits = 0
elif(prev_num_bits == 8):
byte = f.read(1)
prev_num_bits = 0
if byte == b'':
break;
binary = bin(int(binascii.hexlify(byte), 16))[2:].zfill(8)
if num_bits > 1:
b = binary
b = b[:num_bits]
move = int(str(b),2)
prev_num_bits = num_bits
else:
move = 0
next_move = str(my_list[move])
prev_move_black = next_move
else:
#prev_num_bits is less than 8 but adding num_bits to it will push it over 8 bits
num_bits = 8 - prev_num_bits
if byte == b'':
break;
binary = bin(int(binascii.hexlify(byte), 16))[2:].zfill(8)
b = binary
b = b[prev_num_bits: prev_num_bits + num_bits]
move = int(str(b),2)
next_move = str(my_list[move])
prev_move_black = next_move
byte = f.read(1)
prev_num_bits = 0
if byte == b'':
break;
if not next_move:
break;
s = str(board.push_san(next_move))
node = node.add_variation(chess.Move.from_uci(s))
while( (not board.is_checkmate()) and (not board.is_stalemate()) and (not board.is_insufficient_material()) and (not board.is_seventyfive_moves()) and (not board.is_fivefold_repetition())):
#White to Move
l = str(board.legal_moves)
i = l.split("(")
l = i[1]
i = l.split(")")
l = i[0]
my_list = l.split(", ")
if prev_move_white in my_list and len(my_list) > 1:
my_list.remove(prev_move_white)
num_moves = len(my_list)
if num_moves > 2:
num_bits = math.floor(math.log(num_moves,2))
else:
num_bits = 1
if((prev_num_bits + num_bits) <= 8):
if num_bits > 1:
if byte == b'':
break;
binary = bin(int(binascii.hexlify(byte), 16))[2:].zfill(8)
b = binary
b = b[prev_num_bits: prev_num_bits + num_bits]
move = int(str(b),2)
prev_num_bits += num_bits
else:
move = 0
next_move = str(my_list[move])
if not white_last:
prev_move_white = next_move
white_last = True
else:
white_last = False
if prev_num_bits == 8:
byte = f.read(1)
prev_num_bits = 0
elif(prev_num_bits == 8):
byte = f.read(1)
prev_num_bits = 0
if byte == b'':
break;
binary = bin(int(binascii.hexlify(byte), 16))[2:].zfill(8)
if num_bits > 1:
b = binary
b = b[:num_bits]
move = int(str(b),2)
prev_num_bits = num_bits
else:
move = 0
next_move = str(my_list[move])
if not white_last:
prev_move_white = next_move
white_last = True
else:
white_last = False
else:
#prev_num_bits is less than 8 but adding num_bits to it will push it over 8 bits
num_bits = 8 - prev_num_bits
if byte == b'':
break;
binary = bin(int(binascii.hexlify(byte), 16))[2:].zfill(8)
b = binary
b = b[prev_num_bits: prev_num_bits + num_bits]
move = int(str(b),2)
next_move = str(my_list[move])
if not white_last:
prev_move_white = next_move
white_last = True
else:
white_last = False
byte = f.read(1)
prev_num_bits = 0
if byte == b'':
break;
if not next_move:
break;
s = str(board.push_san(next_move))
node = node.add_variation(chess.Move.from_uci(s))
#Black to Move
l = str(board.legal_moves)
i = l.split("(")
l = i[1]
i = l.split(")")
l = i[0]
my_list = l.split(", ")
if prev_move_black in my_list and len(my_list) > 1:
my_list.remove(prev_move_black)
num_moves = len(my_list)
if num_moves > 2:
num_bits = math.floor(math.log(num_moves,2))
else:
num_bits = 1
if((prev_num_bits + num_bits) <= 8):
if num_bits > 1:
if byte == b'':
break;
binary = bin(int(binascii.hexlify(byte), 16))[2:].zfill(8)
b = binary
b = b[prev_num_bits: prev_num_bits + num_bits]
move = int(str(b),2)
prev_num_bits += num_bits
else:
move = 0
next_move = str(my_list[move])
if not black_last:
prev_move_black = next_move
black_last = True
else:
black_last = False
if prev_num_bits == 8:
byte = f.read(1)
prev_num_bits = 0
elif(prev_num_bits == 8):
byte = f.read(1)
prev_num_bits = 0
if byte == b'':
break;
binary = bin(int(binascii.hexlify(byte), 16))[2:].zfill(8)
if num_bits > 1:
b = binary
b = b[:num_bits]
move = int(str(b),2)
prev_num_bits = num_bits
else:
move = 0
next_move = str(my_list[move])
if not black_last:
prev_move_black = next_move
black_last = True
else:
black_last = False
else:
#prev_num_bits is less than 8 but adding num_bits to it will push it over 8 bits
num_bits = 8 - prev_num_bits
if byte == b'':
break;
binary = bin(int(binascii.hexlify(byte), 16))[2:].zfill(8)
b = binary
b = b[prev_num_bits: prev_num_bits + num_bits]
move = int(str(b),2)
next_move = str(my_list[move])
if not black_last:
prev_move_black = next_move
black_last = True
else:
black_last = False
byte = f.read(1)
prev_num_bits = 0
if byte == b'':
break;
if not next_move:
break;
s = str(board.push_san(next_move))
node = node.add_variation(chess.Move.from_uci(s))
fh1.write(str(game))
fh1.write("\n\n")
x += 1
fh1.close()