I believe this is not the case. The first reason is the optimization of the Transposition Table in stockfish. https://github.com/official-stockfish/Stockfish/b

I believe this is not the case. The first reason is the optimization of the Transposition Table in stockfish. https://github.com/official-stockfish/Stockfish/blob/master/src/tt.cpp#L270 https://github.com/official-stockfish/Stockfish/blob/master/... Basically this optimization means that stockfish will sometimes take a bad read from a cache (so it will take an evaluation of the position from cache which was calculated for a different position). It's fairly random when this will trigger a bad play, but if you brute force vs any deterministic setup you will find it eventually. But even withtout it - you can just implement a kind of a brute-force heap of positions using stockfish's own eval and you can find wins from almost any position even on fairly high playout count. I got as far as 32M from different even starting positions, but I spent compute to find as many games as possible rather than as deep as possible. Example game: https://lichess.org/XVUjezMr#134 https://lichess.org/XVUjezMr#134 the collection of the games I found (vibecoded gui) https://kuboble.com/chess_ideas/ https://kuboble.com/chess_ideas/