Datasets:

AngeloWolff
/

snail-chess-data

@@ -6,7 +6,7 @@ tags:
 - self-play
 - evaluation
 size_categories:
-- 10M<n<100M
 viewer: false
 ---
@@ -16,9 +16,9 @@ Chess positions from self-play games of [Snail Chess](https://github.com/CodeAdo
 | | |
 |---|---|
-| Positions | 77.1 million |
-| Games | 922,413 |
-| Download | 0.7 GB (2.5 GB unpacked) |
 | License | CC BY 4.0 |
 ## Quick start
@@ -58,8 +58,12 @@ Snail learned by playing itself. Its old hand-written eval played the first game
 | gen4 | 8,082,566 | Snail Chess 1.16 (gen3 net) | 20,000 |
 | gen5 | 11,227,776 | gen4 net | 50,000 |
 | gen6 | 11,374,723 | gen5 net | 100,000 |
 - Games start from Snail's [opening books](#opening-books) plus one or two random moves. Each part's `.fen` file lists its openings.
 - gen0 started from random moves instead. Its positions were too unusual, so later nets didn't use it.
 - Only quiet positions were saved: not in check, best move not a capture or promotion, no mate score.
@@ -94,10 +98,13 @@ python openings.py openings.txt --count 160000 --random-plies 2
 | gen4 | gen0b–gen4 | - |
 | gen5 | gen2–gen5 | - |
 | gen6 | gen3–gen6 | Snail Chess 1.17 |
-- **Target:** `sigmoid(score / s)`, from search scores only, with `s` fitted to the data (120 for gen6).
-- **Model:** Shell, a tiny gated network (a split-input clipped ReGLU) added to a small base eval.
-- **Training:** mean squared error, Adam, 60 epochs.
 - **Skipped:** positions with flag bit 1 set (about 14%), which the engine scales separately.
 ## Record format

 - self-play
 - evaluation
 size_categories:
+- 100M<n<1B
 viewer: false
 ---
 | | |
 |---|---|
+| Positions | 115.4 million |
+| Games | 1,373,615 |
+| Download | 1.1 GB (3.8 GB unpacked) |
 | License | CC BY 4.0 |
 ## Quick start
 | gen4 | 8,082,566 | Snail Chess 1.16 (gen3 net) | 20,000 |
 | gen5 | 11,227,776 | gen4 net | 50,000 |
 | gen6 | 11,374,723 | gen5 net | 100,000 |
+| gen7 | 12,572,074 | Snail Chess 1.17 (gen6 net) | 200,000 |
+| gen8 | 25,688,615 | Snail Chess 1.18 (gen7 net, 64 lanes) | 10,000 |
 - Games start from Snail's [opening books](#opening-books) plus one or two random moves. Each part's `.fen` file lists its openings.
+- gen7 was played on three PCs at once. Each gen7 part joins a few whole runs, so its records are still whole games, and its `.fen` lists the openings in the same order.
+- gen8 is the first generation played by a 64-lane net, so the node count starts low again. It started from 320,000 openings, twice the usual number, and none of them is an opening of the gen7 run held out for validation.
 - gen0 started from random moves instead. Its positions were too unusual, so later nets didn't use it.
 - Only quiet positions were saved: not in check, best move not a capture or promotion, no mate score.
 | gen4 | gen0b–gen4 | - |
 | gen5 | gen2–gen5 | - |
 | gen6 | gen3–gen6 | Snail Chess 1.17 |
+| gen7 | gen4–gen7 | - |
+| gen7, 64 lanes | gen4–gen7 | Snail Chess 1.18 |
+| gen8, 64 lanes | gen4–gen8 | - |
+- **Target:** `sigmoid(score / s)`, from search scores only, with `s` fitted to the data (120 from gen6 on).
+- **Model:** Shell, a tiny gated network (a split-input clipped ReGLU) added to a small base eval. It had 32 lanes up to gen7 and has 64 since Snail Chess 1.18.
+- **Training:** mean squared error, Adam, 60 epochs (120 for gen8). From gen7 on, the last 5 epochs train through the int8 rounding (quantization-aware training), and one gen7 run is held out for validation.
 - **Skipped:** positions with flag bit 1 set (about 14%), which the engine scales separately.
 ## Record format

data/gen8/part06.bin.xz ADDED Viewed

	@@ -0,0 +1,3 @@

+version https://git-lfs.github.com/spec/v1
+oid sha256:98b8f09a6563c444c09f90f59d7bdb620cb034f98d9ddfd89dd16313bc93f8d0
+size 7240848

data/gen8/part06.fen ADDED Viewed