name string | label string | positions int64 | files list |
|---|---|---|---|
sf-searchtree-n200k | relabel-BT4-tf13tune | 29,378,532,435 | [
{
"file": "sf-searchtree-n200k.000.relabel-BT4-tf13tune.binpack",
"qfile": "sf-searchtree-n200k.000.relabel-BT4-tf13tune.q.i16",
"positions": 119588918,
"bytes": 4066054988
},
{
"file": "sf-searchtree-n200k.001.relabel-BT4-tf13tune.binpack",
"qfile": "sf-searchtree-n200k.001.relabel-BT4-... |
Quiet positions sampled from inside Stockfish's search, labelled with the BT4 net's raw value.
Entries. Every entry is a standalone position (no game chains):
- Position: one whose static evaluation Stockfish computed during search, in self-play at 200,000 nodes per move from the UHO_Lichess_4852_v1 opening book. Sampled at random (0.2% to 1% of the evaluated positions), keeping only positions where the side to move is not in check and has no capture or queen promotion that wins material by static exchange evaluation.
- Score: BT4-tf13tune value head, no search, evaluated from the FEN alone, in the same centipawn mapping as the BT4 relabels of game data (
cp = 660.6 q / (1 - 0.9751875 q^10)). The raw value is kept asq * 32000(see Files). - Ply: always 9999. This marks an entry as a search-tree sample.
- Result: always 0. These positions have no game result.
- Move: an arbitrary legal quiet move, because the format needs one. It carries no information.
Positions are shuffled within blocks of roughly a million and deduplicated within a block.
Use. These are not game positions: train on the score alone (no mixing with a game result) and do not apply the filters meant for game positions. They are meant as a small share of the training samples next to game data.
Files. sf-searchtree-n200k.NNN.relabel-BT4-tf13tune.binpack; manifest.json lists each file with its position count and the name of its raw-value companion. The raw value q of the network comes in one of three forms, all in the order of the entries: .q.f32, one little-endian float32 per entry, exactly as the network returned it (the current form); .q.i16, one little-endian int16 per entry, q * 32000 rounded; or .q.binpack, a second full file with q * 32000 as the score (files 000 to 019). The score of the .binpack file is always computed from the unrounded value.
Engine: Stockfish master 43e01e07 with a sampling hook in the search. Network: BT4-tf13tune.pb.gz.
- Downloads last month
- 1,073