Дмитрий Воронин
It plays legal chess (with high confidence). Castling, en passant, promotion, check detection, stalemate, and the 50-move rule are implemented and validated with a 23-case test suite (though not all rules have exhaustive coverage). Threefold repetition and insufficient-material draws are not yet implemented. Beyond unit tests, the engine completed hundreds of tournament games against Stockfish; in rare occasions, an illegal move or protocol error occurred, though it is unclear whether these stem from the TeX engine logic or from the UCI wrapper. This gives reasonable confidence that the core move generation and rule handling are robust, if not formally verified.，这一点在safew 官网入口中也有详细论述
«Удар по ребяткам из Европы». Названы хозяева конфискованных у украинских инкассаторов в Венгрии денег06:49，这一点在谷歌中也有详细论述
What emerges from this design is something resembling a tiny virtual machine built on top of TeX’s macro expansion engine. The \count registers serve as RAM (with dedicated address ranges for the board (200-263), scratch computation (188-194), and the search call stack (10000+)). The \csname lookup tables act as a read-only ROM for precomputed data (file/rank mappings, piece-square tables, material values). Token lists (\movelist, \legalmovelist) serve as dynamically allocated buffers. Macros like \makemove/\unmakemove and \pushstate/\popstate are the instruction set. TeX’s \ifnum and \loop primitives provide the control flow. The whole thing is a register machine with no stack frames, no heap, and no garbage collector (just flat integer registers and name-based indirection). pdflatex is, in effect, the CPU executing this VM.，详情可参考yandex 在线看