Every register entry, newest first. Short and long stage are labelled separately; the quoted value is the long stage when there is one and is never added to or averaged with the short stage. Verdicts without games name their evidence. This table is not a highlight reel.https://stackruns.com/en-gbhttps://stackruns.com/chess/runs/T-0072/https://stackruns.com/chess/runs/T-0072/Together with the int16 evaluation core, the third network generation replaces the hand evaluation and gains significantly in playing strength compared with the bound predecessor.Tue, 08 Sep 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0071/https://stackruns.com/chess/runs/T-0071/If negamax clamps its alpha-beta window to the mate values reachable at ply [-Mate + ply, Mate - ply - 1], the fixed-depth result and mate distance are preserved, while impossible subtrees are eliminated.Sat, 05 Sep 2026 00:00:00 GMTabgelehnthttps://stackruns.com/chess/runs/T-0070/https://stackruns.com/chess/runs/T-0070/Epoch change of the same predecessor sourceSat, 05 Sep 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0069/https://stackruns.com/chess/runs/T-0069/A session-wide correction of systematic raw evaluation errors, indexed by pawn structure and side to move, can make RFP, null move, Futility and QSearch stand-pat more reliable.Sat, 05 Sep 2026 00:00:00 GMTabgelehnthttps://stackruns.com/chess/runs/T-0068/https://stackruns.com/chess/runs/T-0068/If the main search at depth at most 3 omits materially losing captures, weakly contributing subtrees can be saved without touching the explicitly protected cases.Fri, 04 Sep 2026 00:00:00 GMTabgelehnthttps://stackruns.com/chess/runs/T-0067/https://stackruns.com/chess/runs/T-0067/If a sufficiently deep non-PV node without a TT move is reduced by exactly one level, the worse-ordered search costs less and the saved budget can produce additional depth at more important nodes.Fri, 04 Sep 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0066/https://stackruns.com/chess/runs/T-0066/Using the already maintained occupancy bitboards in scan_board and see preserves search behavior and reduces computational effort.Fri, 04 Sep 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0065/https://stackruns.com/chess/runs/T-0065/Omitting the lower Zobrist bits already determined by the table index enables 16-byte TT entries and doubles the number of slots with the same hash budget; this could reduce TT collisions and search effort.Fri, 04 Sep 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0064/https://stackruns.com/chess/runs/T-0064/A generation-aware, depth-preferred replacement preserves more valuable Transposition table entries and brings measurable Elo compared with unconditional replacement.Thu, 03 Sep 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0063/https://stackruns.com/chess/runs/T-0063/A pure comment line under `engine/src/` leaves the binary unchanged; the identity path can record the candidate as passed without games.Thu, 03 Sep 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0062/https://stackruns.com/chess/runs/T-0062/Epoch change of the same predecessor sourceThu, 03 Sep 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0061/https://stackruns.com/chess/runs/T-0061/Correction K7: counters saturate at INT_MAX, movetime capped; behaviorally identical to the predecessor (manifest empty)Thu, 03 Sep 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0060/https://stackruns.com/chess/runs/T-0060/Correction K2: FEN parsing checks the plausibility of the en-passant square; behaviorally identical to the predecessor (manifest empty)Thu, 03 Sep 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0059/https://stackruns.com/chess/runs/T-0059/Correction K1: draw.inc counts knights correctly; behaviorally identical except for three manifest positionsThu, 03 Sep 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0058/https://stackruns.com/chess/runs/T-0058/Correction K3: evaluate() clamps the side-relative value to [-28999,28999]; behaviorally identical to the predecessor (manifest empty).Thu, 03 Sep 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0057/https://stackruns.com/chess/runs/T-0057/A pure comment line under engine/src/ leaves the binary unchanged; the identity path then records the verdict without games.Thu, 03 Sep 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0056/https://stackruns.com/chess/runs/T-0056/Epoch change of the same predecessor sourceThu, 03 Sep 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0055/https://stackruns.com/chess/runs/T-0055/Infrastructure test on the compute machine: predecessor source against itself (live path cell → SFTP → build → oracle).Wed, 02 Sep 2026 00:00:00 GMTabgelehnthttps://stackruns.com/chess/runs/T-0054/https://stackruns.com/chess/runs/T-0054/Takeover of the running predecessorWed, 02 Sep 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0053/https://stackruns.com/chess/runs/T-0053/Reporting forced mates as signed UCI move counts should make Coherent's analysis output correct for protocol clients without changing the search tree or bench depth.Mon, 31 Aug 2026 00:00:00 GMTdurchgefallenhttps://stackruns.com/chess/runs/T-0052/https://stackruns.com/chess/runs/T-0052/Giving a side with at least two bishops a tapered bonus of 30 centipawns in the middlegame and 50 in the endgame should strengthen Coherent by valuing their complementary color control and greater reach as the board clears.Mon, 31 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0051/https://stackruns.com/chess/runs/T-0051/Tapered pawn-structure scores should improve endgame move choices by increasing doubled- and isolated-pawn penalties with the endgame pawn value and doubling passed-pawn bonuses as non-pawn material disappears.Mon, 31 Aug 2026 00:00:00 GMTdurchgefallenhttps://stackruns.com/chess/runs/T-0050/https://stackruns.com/chess/runs/T-0050/Persisting history and countermove heuristics across searches in a game should improve quiet-move ordering by avoiding a cold start on every move.Mon, 31 Aug 2026 00:00:00 GMTdurchgefallenhttps://stackruns.com/chess/runs/T-0049/https://stackruns.com/chess/runs/T-0049/Probing current-generation transposition bounds in quiescence and prioritizing a matching tactical table move should reduce repeated evaluation, move-generation, and SEE work without replacing deeper principal-search entries.Mon, 31 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0048/https://stackruns.com/chess/runs/T-0048/Pruning non-promoting, non-checking captures with negative SEE at non-PV nodes through depth two should strengthen Coherent by avoiding full searches of exchanges already known to lose material.Mon, 31 Aug 2026 00:00:00 GMTdurchgefallenhttps://stackruns.com/chess/runs/T-0047/https://stackruns.com/chess/runs/T-0047/Preserving castling rights should improve move choices by assigning a phase-tapered value to each retained castling option that the king table and pawn shield do not represent.Sun, 30 Aug 2026 00:00:00 GMTdurchgefallenhttps://stackruns.com/chess/runs/T-0046/https://stackruns.com/chess/runs/T-0046/Configurable 50 ms move overhead and a per-move cap of half the remaining clock should reduce time forfeits by preserving transmission reserve and preventing single searches from exhausting the clock.Sun, 30 Aug 2026 00:00:00 GMTdurchgefallenhttps://stackruns.com/chess/runs/T-0045/https://stackruns.com/chess/runs/T-0045/Deferring quiescence legality checks until a move is tried and inlining debug-checked board access should strengthen Coherent by avoiding duplicate make, check, and unmake work, especially for full check-evasion lists.Sun, 30 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0044/https://stackruns.com/chess/runs/T-0044/Coherent should search more positions in the allotted time because pseudo-legal move generation enumerates only the moving side's occupied squares from incrementally maintained masks while preserving move order.Sun, 30 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0043/https://stackruns.com/chess/runs/T-0043/Preallocating the pseudo-legal move vector should strengthen Coherent because it removes the dominant repeated growth allocations while preserving move order and retaining automatic vector growth as a safe fallback.Sun, 30 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0042/https://stackruns.com/chess/runs/T-0042/Restricting quiescence stalemate checks to low-material positions without an unblocked pawn should correct drawn endgame scores without paying for legal move generation on common stand-pat exits.Sun, 30 Aug 2026 00:00:00 GMTdurchgefallenhttps://stackruns.com/chess/runs/T-0041/https://stackruns.com/chess/runs/T-0041/Limiting each line to two check extensions should improve move selection by preserving the first two tactical extensions while preventing long checking sequences from monopolizing the search budget.Sun, 30 Aug 2026 00:00:00 GMTdurchgefallenhttps://stackruns.com/chess/runs/T-0040/https://stackruns.com/chess/runs/T-0040/Retaining transposition moves across searches in an explicit game session should strengthen play by improving move ordering on successive positions while generation-scoped bounds avoid reusing clock- or repetition-dependent scores.Sun, 30 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0039/https://stackruns.com/chess/runs/T-0039/Increasing the maximum quiescence depth from six to eight plies should strengthen Coherent by resolving longer forcing capture sequences now that tactical move generation and pruning keep the added search cost modest.Sun, 30 Aug 2026 00:00:00 GMTdurchgefallenhttps://stackruns.com/chess/runs/T-0038/https://stackruns.com/chess/runs/T-0038/Correctly treating bishop-and-knight and two-knight endings as playable rather than automatic draws should strengthen endgame decisions because checkmate remains legally possible in both material configurations.Sun, 30 Aug 2026 00:00:00 GMTdurchgefallenhttps://stackruns.com/chess/runs/T-0037/https://stackruns.com/chess/runs/T-0037/Scoring stalemate as a draw in quiescence should prevent static material evaluations from favoring drawing continuations in otherwise winning endgames.Sun, 30 Aug 2026 00:00:00 GMTdurchgefallenhttps://stackruns.com/chess/runs/T-0036/https://stackruns.com/chess/runs/T-0036/Coherent should search more nodes within its time limit because child and PVS re-searches reuse the parent's already computed check status instead of scanning attacks again.Sun, 30 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0035/https://stackruns.com/chess/runs/T-0035/Searching a valid transposition-table move before ordering the remaining moves should make the engine stronger by avoiding unnecessary SEE evaluations and sorting when that move causes an immediate cutoff.Sat, 29 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0034/https://stackruns.com/chess/runs/T-0034/Coherent should play more strongly because replacing full-board Undo snapshots with reversible move metadata reduces copy traffic in every legality check and searched move.Sat, 29 Aug 2026 00:00:00 GMTdurchgefallenhttps://stackruns.com/chess/runs/T-0033/https://stackruns.com/chess/runs/T-0033/Incrementally cached king squares should improve playing strength by eliminating repeated board scans from check detection while preserving the search tree.Sat, 29 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0032/https://stackruns.com/chess/runs/T-0032/Ordering pseudo-legal moves and rejecting self-check only for each attempted move should strengthen search by avoiding full-list legalization at nodes that cut off after examining only a few moves.Sat, 29 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0031/https://stackruns.com/chess/runs/T-0031/Generating only legal captures, en passant moves, and promotions outside check should strengthen play by avoiding make/unmake work for quiet moves that quiescence discards while preserving the search tree.Sat, 29 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0030/https://stackruns.com/chess/runs/T-0030/Counting distinct pieces and attacked squares around the enemy king should improve tactical threat recognition by rewarding coordinated attacks rather than general mobility alone.Sat, 29 Aug 2026 00:00:00 GMTdurchgefallenhttps://stackruns.com/chess/runs/T-0029/https://stackruns.com/chess/runs/T-0029/Search strength should improve because deeper or clearly favorable nodes use larger null-move reductions while high-depth verification rejects unsafe cutoffs in zugzwang-prone positions.Sat, 29 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0028/https://stackruns.com/chess/runs/T-0028/Depth- and move-count-dependent reductions of up to three plies for late quiet moves, softened at principal-variation nodes and for killer, countermove, or high-history moves and followed by a full-depth re-search after an alpha raise, should make Coherent stronger by spending fewer nodes on unlikely late alternatives.Sat, 29 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0027/https://stackruns.com/chess/runs/T-0027/Search should become stronger because penalizing quiet moves that fail before a quiet beta cutoff keeps history scores discriminative, while a countermove table prioritizes context-specific cutoff replies.Sat, 29 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0026/https://stackruns.com/chess/runs/T-0026/Verified razoring should strengthen Coherent by replacing full searches of shallow fail-low nodes with cheaper quiescence searches while preserving tactically forcing replies.Sat, 29 Aug 2026 00:00:00 GMTdurchgefallenhttps://stackruns.com/chess/runs/T-0025/https://stackruns.com/chess/runs/T-0025/Pruning non-checking, non-promotion quiescence captures that cannot reach alpha by a material delta bound or have a negative static exchange evaluation should strengthen Coherent by spending fewer nodes on unpromising leaf exchanges.Sat, 29 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0024/https://stackruns.com/chess/runs/T-0024/Late move pruning should strengthen Coherent by spending shallow non-PV search effort on earlier ordered and forcing moves instead of unlikely late quiet moves.Sat, 29 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0023/https://stackruns.com/chess/runs/T-0023/Using non-cutting transposition-table bounds to narrow alpha-beta windows should reduce redundant search because previously proven score limits can trigger earlier cutoffs.Sat, 29 Aug 2026 00:00:00 GMTdurchgefallenhttps://stackruns.com/chess/runs/T-0022/https://stackruns.com/chess/runs/T-0022/Coherent should make stronger moves under tournament time controls because phase-aware soft time limits save clock in stable positions and let unstable positions search longer within a reserved hard limit.Sat, 29 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0021/https://stackruns.com/chess/runs/T-0021/Searching forced check evasions beyond the quiescence depth limit and including quiet promotions should strengthen tactical play by avoiding static evaluations of positions where a legal forcing move remains.Sat, 29 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0020/https://stackruns.com/chess/runs/T-0020/The engine should play more strongly because it will preserve winnable minor-piece endings, recognize repetitions despite irrelevant en-passant fields, and keep halfmove- and path-dependent draw scores from contaminating the transposition table.Sat, 29 Aug 2026 00:00:00 GMTdurchgefallenhttps://stackruns.com/chess/runs/T-0019/https://stackruns.com/chess/runs/T-0019/Depth-preferred replacement with generation aging should improve move selection in longer games by preserving deeper transposition results from shallower collisions while allowing stale entries to yield immediately.Sat, 29 Aug 2026 00:00:00 GMTdurchgefallenhttps://stackruns.com/chess/runs/T-0018/https://stackruns.com/chess/runs/T-0018/Scoring pseudo-legal destination squares for knights, bishops, rooks, and queens should improve move selection by preferring active pieces without duplicating the existing pawn-structure and king-safety terms.Sat, 29 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0017/https://stackruns.com/chess/runs/T-0017/Splitting the piece values and the piece-square table into separate middlegame and endgame columns and interpolating between them by the non-pawn material still on the board should play endgames better, above all because the single table previously told the king to centralise in every phase, including the middlegame where it belongs behind its own pawns.Sat, 29 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0016/https://stackruns.com/chess/runs/T-0016/Futility pruning at shallow depths — cutting a node outright when its static evaluation stands a pawn per remaining ply above beta, and skipping quiet moves when it stands that far below alpha — should shrink the tree enough to reach greater depth in the same time, with both cuts disabled in check and in pawn-only endgames where the static evaluation cannot be trusted.Sat, 29 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0015/https://stackruns.com/chess/runs/T-0015/The search now scores threefold repetition, the fifty-move rule and insufficient material as draws, checked before the transposition-table cut because two of the three depend on the path to the position, so the engine should stop repeating won positions into draws and stop valuing material it can never mate with.Sat, 29 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0014/https://stackruns.com/chess/runs/T-0014/In quiescence search a side to move that is in check no longer stands pat but searches every legal evasion, quiet moves and promotions included, and reports mate when there is none, so the value returned at the horizon comes from a continuation that actually exists.Sat, 29 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0013/https://stackruns.com/chess/runs/T-0013/Extending the main search by one ply whenever the side to move is in check should improve play in forcing lines, above all at the horizon, where a checked position was previously handed to a quiescence search that only sees captures and therefore evaluated it statically with the king under attack.Sat, 29 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0012/https://stackruns.com/chess/runs/T-0012/Ranking captures that a static exchange evaluation shows to lose material behind every quiet move, instead of ahead of them as MVV-LVA alone does, should raise the alpha-beta cut-off rate and make each search depth cheaper.Sat, 29 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0011/https://stackruns.com/chess/runs/T-0011/Searching every sibling move with a null window and re-searching only when it raises alpha should shrink the search tree at equal depth, because the existing move ordering makes the first move best often enough that the exact value of the others is never needed.Sat, 29 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0010/https://stackruns.com/chess/runs/T-0010/From depth 4 on, each iterative-deepening iteration searches inside a 50-centipawn window around the previous iteration's score and re-searches only the side that fails, so tighter alpha-beta bounds should prune subtrees that the full window searches.Sat, 29 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0009/https://stackruns.com/chess/runs/T-0009/Evaluation gains handwritten pawn-structure terms (doubled, isolated and passed pawns) and a king-safety term (pawn shield plus open files beside the king, scaled down with the opponent's remaining piece material), so that quiet positions are judged by more than material and piece-square tables, at a measured cost of 3.5 percent in nodes per second.Fri, 28 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0008/https://stackruns.com/chess/runs/T-0008/Reducing quiet moves ordered fourth or later by one ply, with a full-depth re-search whenever the reduced null-window probe raises alpha, should trade a small risk of overlooking a good quiet move for a roughly 2.5-fold smaller tree at equal depth, and so reach greater depth in the same thinking time.Fri, 28 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0007/https://stackruns.com/chess/runs/T-0007/Null-move forward pruning with a zugzwang guard — the null move is only tried when the side to move still has a piece besides king and pawns — should cut roughly half the search tree at equal depth and so reach deeper in the same time, without the endgame blindness an unguarded null move causes.Fri, 28 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0006/https://stackruns.com/chess/runs/T-0006/Coherent should play stronger because killer moves and a history heuristic order the quiet moves that MVV-LVA leaves untouched, letting beta cutoffs happen earlier so the same depth costs fewer nodes.Fri, 28 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0005/https://stackruns.com/chess/runs/T-0005/Searching the previous iteration's best root move first in iterative deepening should shrink the search tree, because the root never probes the transposition table and otherwise re-searches every depth in the same static MVV-LVA order.Fri, 28 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0004/https://stackruns.com/chess/runs/T-0004/A Zobrist-keyed transposition table (always replace, cutoffs only when the stored entry is deep enough and its bound settles the question, stored move searched first) cuts the fixed-depth node count to 72 % at depth 4 and 53 % at depth 5 on the project's 500 random test positions without changing a single score, so the same time budget should reach deeper.Fri, 28 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0003/https://stackruns.com/chess/runs/T-0003/Sorting captures by MVV-LVA ahead of quiet moves at every node makes alpha-beta cut off far earlier - the same fixed-depth scores are reached with 45x to 381x fewer nodes across twelve positions at depths 1 to 3 - so within a fixed time budget the engine should search materially deeper.Fri, 28 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0002/https://stackruns.com/chess/runs/T-0002/Resolving captures at the leaves with a quiescence search capped at six plies should stop the engine from misjudging positions where the recapture lies just beyond the fixed depth, at the price of a larger tree; the bench fingerprint depth was lowered from 4 to 3 to keep a bench run under two seconds.Fri, 28 Aug 2026 00:00:00 GMTbestandenhttps://stackruns.com/chess/runs/T-0001/https://stackruns.com/chess/runs/T-0001/Negative control: unchanged source code of reference v0. No difference is expected, therefore a fail at the lower bound. Tests the measurement chain, not the engine.Fri, 28 Aug 2026 00:00:00 GMTdurchgefallen