Lina1712 commited on
Commit
06e1a47
·
verified ·
1 Parent(s): f7939d5

Chess Challenge submission by Lina1712

Browse files
Files changed (7) hide show
  1. README.md +26 -0
  2. config.json +20 -0
  3. model.safetensors +3 -0
  4. special_tokens_map.json +6 -0
  5. tokenizer.py +350 -0
  6. tokenizer_config.json +45 -0
  7. vocab.json +146 -0
README.md ADDED
@@ -0,0 +1,26 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ ---
2
+ library_name: transformers
3
+ tags:
4
+ - chess
5
+ - llm-course
6
+ - chess-challenge
7
+ license: mit
8
+ ---
9
+
10
+ # chess_LinaBellahmidi
11
+
12
+ Chess model submitted to the LLM Course Chess Challenge.
13
+
14
+ ## Submission Info
15
+
16
+ - **Submitted by**: [Lina1712](https://huggingface.co/Lina1712)
17
+ - **Parameters**: 894,240
18
+ - **Organization**: LLM-course
19
+
20
+ ## Model Details
21
+
22
+ - **Architecture**: Chess Transformer (GPT-style)
23
+ - **Vocab size**: 144
24
+ - **Embedding dim**: 144
25
+ - **Layers**: 4
26
+ - **Heads**: 4
config.json ADDED
@@ -0,0 +1,20 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "architectures": [
3
+ "ChessForCausalLM"
4
+ ],
5
+ "bos_token_id": 1,
6
+ "dropout": 0.1,
7
+ "dtype": "float32",
8
+ "eos_token_id": 2,
9
+ "layer_norm_epsilon": 1e-05,
10
+ "model_type": "chess_transformer",
11
+ "n_ctx": 256,
12
+ "n_embd": 144,
13
+ "n_head": 4,
14
+ "n_inner": 432,
15
+ "n_layer": 4,
16
+ "pad_token_id": 0,
17
+ "tie_weights": true,
18
+ "transformers_version": "4.57.6",
19
+ "vocab_size": 144
20
+ }
model.safetensors ADDED
@@ -0,0 +1,3 @@
 
 
 
 
1
+ version https://git-lfs.github.com/spec/v1
2
+ oid sha256:351358ce2825386d602a1bdb22ab4bd103528a106428135ceb84bc2c4b90f291
3
+ size 3581376
special_tokens_map.json ADDED
@@ -0,0 +1,6 @@
 
 
 
 
 
 
 
1
+ {
2
+ "bos_token": "[BOS]",
3
+ "eos_token": "[EOS]",
4
+ "pad_token": "[PAD]",
5
+ "unk_token": "[UNK]"
6
+ }
tokenizer.py ADDED
@@ -0,0 +1,350 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ """
2
+ Custom Chess Tokenizer for the Chess Challenge.
3
+
4
+ This tokenizer treats each move as a single token using the extended UCI notation
5
+ from the Lichess dataset (e.g., WPe2e4, BNg8f6).
6
+
7
+ The dataset format uses:
8
+ - W/B prefix for White/Black
9
+ - Piece letter: P=Pawn, N=Knight, B=Bishop, R=Rook, Q=Queen, K=King
10
+ - Source and destination squares (e.g., e2e4)
11
+ - Special suffixes: (x)=capture, (+)=check, (+*)=checkmate, (o)/(O)=castling
12
+ """
13
+
14
+ from __future__ import annotations
15
+
16
+ import json
17
+ import os
18
+ from pathlib import Path
19
+ from typing import Dict, List, Optional
20
+
21
+ from transformers import PreTrainedTokenizer
22
+
23
+
24
+ class ChessTokenizer(PreTrainedTokenizer):
25
+ """
26
+ A custom tokenizer for chess moves using extended UCI notation.
27
+
28
+ This tokenizer maps each possible chess move to a unique token ID.
29
+ The vocabulary is built from the training dataset to ensure all moves
30
+ encountered during training have a corresponding token.
31
+
32
+ Example:
33
+ >>> tokenizer = ChessTokenizer()
34
+ >>> tokenizer.encode("WPe2e4 BPe7e5")
35
+ [1, 42, 87, 2] # [BOS, e2e4, e7e5, EOS]
36
+ """
37
+
38
+ model_input_names = ["input_ids", "attention_mask"]
39
+ vocab_files_names = {"vocab_file": "vocab.json"}
40
+
41
+ # Special tokens
42
+ PAD_TOKEN = "[PAD]"
43
+ BOS_TOKEN = "[BOS]"
44
+ EOS_TOKEN = "[EOS]"
45
+ UNK_TOKEN = "[UNK]"
46
+
47
+ def __init__(
48
+ self,
49
+ vocab_file: Optional[str] = None,
50
+ vocab: Optional[Dict[str, int]] = None,
51
+ decomposed: bool = False,
52
+ **kwargs,
53
+ ):
54
+ """
55
+ Initialize the chess tokenizer.
56
+
57
+ Args:
58
+ vocab_file: Path to a JSON file containing the vocabulary mapping.
59
+ vocab: Dictionary mapping tokens to IDs (alternative to vocab_file).
60
+ **kwargs: Additional arguments passed to PreTrainedTokenizer.
61
+ """
62
+ # Store tokenization mode
63
+ self.decomposed = decomposed
64
+
65
+ # Initialize special tokens
66
+ self._pad_token = self.PAD_TOKEN
67
+ self._bos_token = self.BOS_TOKEN
68
+ self._eos_token = self.EOS_TOKEN
69
+ self._unk_token = self.UNK_TOKEN
70
+
71
+ # Remove any duplicate special-token entries passed through kwargs
72
+ # to avoid "multiple values for keyword" errors when loading from disk.
73
+ kwargs.pop("pad_token", None)
74
+ kwargs.pop("bos_token", None)
75
+ kwargs.pop("eos_token", None)
76
+ kwargs.pop("unk_token", None)
77
+
78
+ # Load or create vocabulary
79
+ if vocab is not None:
80
+ self._vocab = vocab
81
+ elif vocab_file is not None and os.path.exists(vocab_file):
82
+ with open(vocab_file, "r", encoding="utf-8") as f:
83
+ self._vocab = json.load(f)
84
+ else:
85
+ # Create a minimal vocabulary with just special tokens
86
+ # The full vocabulary should be built from the dataset
87
+ self._vocab = self._create_default_vocab()
88
+
89
+ # Create reverse mapping
90
+ self._ids_to_tokens = {v: k for k, v in self._vocab.items()}
91
+
92
+ # Call parent init AFTER setting up vocab
93
+ super().__init__(
94
+ pad_token=self._pad_token,
95
+ bos_token=self._bos_token,
96
+ eos_token=self._eos_token,
97
+ unk_token=self._unk_token,
98
+ decomposed=self.decomposed,
99
+ **kwargs,
100
+ )
101
+
102
+ def _create_default_vocab(self) -> Dict[str, int]:
103
+ """
104
+ Create a minimal default vocabulary with just special tokens.
105
+
106
+ For the full vocabulary, use `build_vocab_from_dataset()`.
107
+ This minimal vocab is just a placeholder - you should build from data.
108
+ """
109
+ special_tokens = [self.PAD_TOKEN, self.BOS_TOKEN, self.EOS_TOKEN, self.UNK_TOKEN]
110
+ vocab = {token: idx for idx, token in enumerate(special_tokens)}
111
+ return vocab
112
+
113
+ @classmethod
114
+ def build_vocab_from_iterator(
115
+ cls,
116
+ iterator,
117
+ min_frequency: int = 1,
118
+ max_vocab_size: Optional[int] = None,
119
+ decomposed: bool = False,
120
+ ) -> "ChessTokenizer":
121
+ """
122
+ Build a tokenizer vocabulary from an iterator of game strings.
123
+
124
+ Args:
125
+ iterator: An iterator yielding game strings (space-separated moves).
126
+ min_frequency: Minimum frequency for a token to be included.
127
+ max_vocab_size: Optional cap on the number of move tokens.
128
+ decomposed: If True, decompose moves into piece/from/to tokens.
129
+
130
+ Returns:
131
+ A ChessTokenizer with the built vocabulary.
132
+ """
133
+ from collections import Counter
134
+
135
+ token_counts = Counter()
136
+
137
+ for game in iterator:
138
+ moves = game.strip().split()
139
+ if decomposed:
140
+ decomposed_tokens = []
141
+ for move in moves:
142
+ decomposed_tokens.extend(cls._decompose_move(move))
143
+ token_counts.update(decomposed_tokens)
144
+ else:
145
+ token_counts.update(moves)
146
+
147
+ # Filter by frequency, then sort by count (desc) and token (asc)
148
+ tokens = [
149
+ (token, count) for token, count in token_counts.items()
150
+ if count >= min_frequency
151
+ ]
152
+ tokens.sort(key=lambda item: (-item[1], item[0]))
153
+
154
+ # Apply optional vocab cap
155
+ if max_vocab_size is not None:
156
+ tokens = tokens[:max_vocab_size]
157
+
158
+ # Extract token strings in deterministic order
159
+ tokens = [token for token, _ in tokens]
160
+
161
+ # Build vocabulary
162
+ special_tokens = [cls.PAD_TOKEN, cls.BOS_TOKEN, cls.EOS_TOKEN, cls.UNK_TOKEN]
163
+ vocab = {token: idx for idx, token in enumerate(special_tokens + tokens)}
164
+
165
+ return cls(vocab=vocab, decomposed=decomposed)
166
+
167
+ @classmethod
168
+ def build_vocab_from_dataset(
169
+ cls,
170
+ dataset_name: str = "dlouapre/lichess_2025-01_1M",
171
+ split: str = "train",
172
+ column: str = "text",
173
+ min_frequency: int = 500,
174
+ max_samples: Optional[int] = 100000,
175
+ max_vocab_size: Optional[int] = None,
176
+ decomposed: bool = False,
177
+ ) -> "ChessTokenizer":
178
+ """
179
+ Build a tokenizer vocabulary from a Hugging Face dataset.
180
+
181
+ Args:
182
+ dataset_name: Name of the dataset on Hugging Face Hub.
183
+ split: Dataset split to use.
184
+ column: Column containing the game strings.
185
+ min_frequency: Minimum frequency for a token to be included (default: 500).
186
+ max_samples: Maximum number of samples to process (default: 100k).
187
+ max_vocab_size: Optional cap on the number of move tokens.
188
+ decomposed: If True, decompose moves into piece/from/to tokens.
189
+
190
+ Returns:
191
+ A ChessTokenizer with the built vocabulary.
192
+ """
193
+ from datasets import load_dataset
194
+
195
+ dataset = load_dataset(dataset_name, split=split)
196
+
197
+ if max_samples is not None:
198
+ dataset = dataset.select(range(min(max_samples, len(dataset))))
199
+
200
+ def game_iterator():
201
+ for example in dataset:
202
+ yield example[column]
203
+
204
+ return cls.build_vocab_from_iterator(
205
+ game_iterator(),
206
+ min_frequency=min_frequency,
207
+ max_vocab_size=max_vocab_size,
208
+ decomposed=decomposed,
209
+ )
210
+
211
+ @staticmethod
212
+ def _decompose_move(move: str) -> List[str]:
213
+ """
214
+ Decompose an extended UCI move into tokens.
215
+
216
+ Output tokens:
217
+ - "WP" (color + piece)
218
+ - "e2_f" (from square)
219
+ - "e4_t" (to square, or "e8=Q_t" for promotions)
220
+ """
221
+ if len(move) < 6:
222
+ return [move]
223
+
224
+ color = move[0]
225
+ piece = move[1]
226
+ from_sq = move[2:4]
227
+ to_sq = move[4:6]
228
+
229
+ promo = None
230
+ if "=" in move:
231
+ promo_idx = move.find("=")
232
+ if promo_idx != -1 and promo_idx + 1 < len(move):
233
+ promo = move[promo_idx + 1].upper()
234
+
235
+ from_tok = f"{from_sq}_f"
236
+ if promo:
237
+ to_tok = f"{to_sq}={promo}_t"
238
+ else:
239
+ to_tok = f"{to_sq}_t"
240
+
241
+ return [f"{color}{piece}", from_tok, to_tok]
242
+
243
+ @property
244
+ def vocab_size(self) -> int:
245
+ """Return the size of the vocabulary."""
246
+ return len(self._vocab)
247
+
248
+ def get_vocab(self) -> Dict[str, int]:
249
+ """Return the vocabulary as a dictionary."""
250
+ return dict(self._vocab)
251
+
252
+ def _tokenize(self, text: str) -> List[str]:
253
+ """
254
+ Tokenize a string of moves into a list of tokens.
255
+
256
+ Args:
257
+ text: A string of space-separated moves.
258
+
259
+ Returns:
260
+ List of move tokens.
261
+ """
262
+ tokens = text.strip().split()
263
+ if not self.decomposed:
264
+ return tokens
265
+
266
+ # If the input already looks decomposed, don't expand again.
267
+ if any("_f" in tok or "_t" in tok for tok in tokens):
268
+ return tokens
269
+
270
+ decomposed_tokens: List[str] = []
271
+ for move in tokens:
272
+ decomposed_tokens.extend(self._decompose_move(move))
273
+ return decomposed_tokens
274
+
275
+ def _convert_token_to_id(self, token: str) -> int:
276
+ """Convert a token to its ID."""
277
+ return self._vocab.get(token, self._vocab.get(self.UNK_TOKEN, 0))
278
+
279
+ def _convert_id_to_token(self, index: int) -> str:
280
+ """Convert an ID to its token."""
281
+ return self._ids_to_tokens.get(index, self.UNK_TOKEN)
282
+
283
+ def convert_tokens_to_string(self, tokens: List[str]) -> str:
284
+ """Convert a list of tokens back to a string."""
285
+ # Filter out special tokens for cleaner output
286
+ special = {self.PAD_TOKEN, self.BOS_TOKEN, self.EOS_TOKEN, self.UNK_TOKEN}
287
+ return " ".join(t for t in tokens if t not in special)
288
+
289
+ def save_vocabulary(
290
+ self,
291
+ save_directory: str,
292
+ filename_prefix: Optional[str] = None,
293
+ ) -> tuple:
294
+ """
295
+ Save the vocabulary to a JSON file.
296
+
297
+ Args:
298
+ save_directory: Directory to save the vocabulary.
299
+ filename_prefix: Optional prefix for the filename.
300
+
301
+ Returns:
302
+ Tuple containing the path to the saved vocabulary file.
303
+ """
304
+ if not os.path.isdir(save_directory):
305
+ os.makedirs(save_directory, exist_ok=True)
306
+
307
+ vocab_file = os.path.join(
308
+ save_directory,
309
+ (filename_prefix + "-" if filename_prefix else "") + "vocab.json",
310
+ )
311
+
312
+ with open(vocab_file, "w", encoding="utf-8") as f:
313
+ json.dump(self._vocab, f, ensure_ascii=False, indent=2)
314
+
315
+ return (vocab_file,)
316
+
317
+
318
+ def count_vocab_from_dataset(
319
+ dataset_name: str = "dlouapre/lichess_2025-01_1M",
320
+ split: str = "train",
321
+ column: str = "text",
322
+ max_samples: Optional[int] = 10000,
323
+ ) -> Dict[str, int]:
324
+ """
325
+ Count token frequencies in a dataset (useful for vocabulary analysis).
326
+
327
+ Args:
328
+ dataset_name: Name of the dataset on Hugging Face Hub.
329
+ split: Dataset split to use.
330
+ column: Column containing the game strings.
331
+ max_samples: Maximum number of samples to process.
332
+
333
+ Returns:
334
+ Dictionary mapping tokens to their frequencies.
335
+ """
336
+ from collections import Counter
337
+ from datasets import load_dataset
338
+
339
+ dataset = load_dataset(dataset_name, split=split)
340
+
341
+ if max_samples is not None:
342
+ dataset = dataset.select(range(min(max_samples, len(dataset))))
343
+
344
+ token_counts = Counter()
345
+
346
+ for example in dataset:
347
+ moves = example[column].strip().split()
348
+ token_counts.update(moves)
349
+
350
+ return dict(token_counts)
tokenizer_config.json ADDED
@@ -0,0 +1,45 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "added_tokens_decoder": {
3
+ "0": {
4
+ "content": "[PAD]",
5
+ "lstrip": false,
6
+ "normalized": false,
7
+ "rstrip": false,
8
+ "single_word": false,
9
+ "special": true
10
+ },
11
+ "1": {
12
+ "content": "[BOS]",
13
+ "lstrip": false,
14
+ "normalized": false,
15
+ "rstrip": false,
16
+ "single_word": false,
17
+ "special": true
18
+ },
19
+ "2": {
20
+ "content": "[EOS]",
21
+ "lstrip": false,
22
+ "normalized": false,
23
+ "rstrip": false,
24
+ "single_word": false,
25
+ "special": true
26
+ },
27
+ "3": {
28
+ "content": "[UNK]",
29
+ "lstrip": false,
30
+ "normalized": false,
31
+ "rstrip": false,
32
+ "single_word": false,
33
+ "special": true
34
+ }
35
+ },
36
+ "bos_token": "[BOS]",
37
+ "clean_up_tokenization_spaces": false,
38
+ "decomposed": true,
39
+ "eos_token": "[EOS]",
40
+ "extra_special_tokens": {},
41
+ "model_max_length": 1000000000000000019884624838656,
42
+ "pad_token": "[PAD]",
43
+ "tokenizer_class": "ChessTokenizer",
44
+ "unk_token": "[UNK]"
45
+ }
vocab.json ADDED
@@ -0,0 +1,146 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "[PAD]": 0,
3
+ "[BOS]": 1,
4
+ "[EOS]": 2,
5
+ "[UNK]": 3,
6
+ "WP": 4,
7
+ "BP": 5,
8
+ "WN": 6,
9
+ "BN": 7,
10
+ "WB": 8,
11
+ "BB": 9,
12
+ "WR": 10,
13
+ "BR": 11,
14
+ "BK": 12,
15
+ "WQ": 13,
16
+ "WK": 14,
17
+ "BQ": 15,
18
+ "d5_t": 16,
19
+ "d4_t": 17,
20
+ "e5_t": 18,
21
+ "e4_t": 19,
22
+ "f3_t": 20,
23
+ "f6_t": 21,
24
+ "e7_f": 22,
25
+ "c6_t": 23,
26
+ "c3_t": 24,
27
+ "d7_f": 25,
28
+ "e2_f": 26,
29
+ "d2_f": 27,
30
+ "f1_f": 28,
31
+ "f8_f": 29,
32
+ "g1_f": 30,
33
+ "g8_f": 31,
34
+ "c4_t": 32,
35
+ "f3_f": 33,
36
+ "e6_t": 34,
37
+ "c5_t": 35,
38
+ "d1_f": 36,
39
+ "d8_f": 37,
40
+ "f6_f": 38,
41
+ "e1_f": 39,
42
+ "d6_t": 40,
43
+ "f4_t": 41,
44
+ "e8_f": 42,
45
+ "g5_t": 43,
46
+ "c8_f": 44,
47
+ "d3_t": 45,
48
+ "f5_t": 46,
49
+ "c1_f": 47,
50
+ "e7_t": 48,
51
+ "e3_t": 49,
52
+ "e4_f": 50,
53
+ "g4_t": 51,
54
+ "d7_t": 52,
55
+ "b8_f": 53,
56
+ "c7_f": 54,
57
+ "e5_f": 55,
58
+ "b1_f": 56,
59
+ "c6_f": 57,
60
+ "e2_t": 58,
61
+ "d4_f": 59,
62
+ "c2_f": 60,
63
+ "d2_t": 61,
64
+ "c3_f": 62,
65
+ "d5_f": 63,
66
+ "g6_t": 64,
67
+ "b5_t": 65,
68
+ "g7_f": 66,
69
+ "b4_t": 67,
70
+ "g3_t": 68,
71
+ "b7_f": 69,
72
+ "f7_f": 70,
73
+ "f2_f": 71,
74
+ "g1_t": 72,
75
+ "g8_t": 73,
76
+ "c4_f": 74,
77
+ "g2_f": 75,
78
+ "c5_f": 76,
79
+ "d6_f": 77,
80
+ "d3_f": 78,
81
+ "b2_f": 79,
82
+ "e6_f": 80,
83
+ "f4_f": 81,
84
+ "b6_t": 82,
85
+ "g5_f": 83,
86
+ "b3_t": 84,
87
+ "e3_f": 85,
88
+ "h5_t": 86,
89
+ "g4_f": 87,
90
+ "h6_t": 88,
91
+ "h4_t": 89,
92
+ "h2_f": 90,
93
+ "h3_t": 91,
94
+ "f5_f": 92,
95
+ "h7_f": 93,
96
+ "e1_t": 94,
97
+ "d8_t": 95,
98
+ "g7_t": 96,
99
+ "a8_f": 97,
100
+ "e8_t": 98,
101
+ "a1_f": 99,
102
+ "d1_t": 100,
103
+ "a7_f": 101,
104
+ "a5_t": 102,
105
+ "a6_t": 103,
106
+ "a4_t": 104,
107
+ "b5_f": 105,
108
+ "a2_f": 106,
109
+ "f7_t": 107,
110
+ "c8_t": 108,
111
+ "b4_f": 109,
112
+ "c7_t": 110,
113
+ "c1_t": 111,
114
+ "a3_t": 112,
115
+ "c2_t": 113,
116
+ "f2_t": 114,
117
+ "g2_t": 115,
118
+ "g6_f": 116,
119
+ "g3_f": 117,
120
+ "b7_t": 118,
121
+ "f8_t": 119,
122
+ "h5_f": 120,
123
+ "h4_f": 121,
124
+ "b6_f": 122,
125
+ "f1_t": 123,
126
+ "b3_f": 124,
127
+ "b2_t": 125,
128
+ "a5_f": 126,
129
+ "a4_f": 127,
130
+ "h6_f": 128,
131
+ "h3_f": 129,
132
+ "b8_t": 130,
133
+ "b1_t": 131,
134
+ "h8_f": 132,
135
+ "a6_f": 133,
136
+ "h7_t": 134,
137
+ "h1_f": 135,
138
+ "h2_t": 136,
139
+ "a3_f": 137,
140
+ "h8_t": 138,
141
+ "h1_t": 139,
142
+ "a2_t": 140,
143
+ "a7_t": 141,
144
+ "a8_t": 142,
145
+ "a1_t": 143
146
+ }