Tạo plan làm chess engine theo README.md sau: # NCT_10A5 N...
Prompt
Tạo plan làm chess engine theo README.md sau: # NCT_10A5 NCT_10A5 is a small UCI chess engine by Nguyễn Thạch Anh. Implementation: - C chess rules, legal move generation, UCI protocol, and search - NASM x64 helper for deterministic Zobrist-key mixing - `patternbase.c` / `patternbase.h`: 256 policy slots (16 tactical families x 16 fluid variants) for opportunities, threats, and rescue moves - SSE4.2/POPCNT build with 128-bit SIMD dot products and incremental Zobrist TT keys - Iterative-deepening minimax with alpha-beta pruning - Principal-variation search, aspiration windows, transposition table, quiescence search, move ordering, killer moves, and history heuristic - Incremental piece counts/bitboards/king squares, O(1) Zobrist updates, and a per-search evaluation cache to avoid repeated O(n^2)-style rescans - Tactical quiescence move generation and precomputed 64-square attack masks reduce legal-move validation work - SIMD 16-bit feature dot products for material scoring and exact root-parallel search up to 512 configured workers - Pattern evaluation for pawn chains, passed/isolated/doubled pawns, knight outposts, center control, open files, bishop pair, king shelter, and piece activity PatternBase uses a shared feature vector and SSE4.2 128-bit integer dot products (`pmaddwd`/horizontal reduction). Its policy calls are reentrant, so the existing root worker threads can evaluate the 256-slot bank concurrently without spawning a thread per node. Tactical gating skips the bank in quiet nodes to keep compute low. The bank includes explicit families for king-box/back-rank danger, two-rook/heavy-piece batteries, smothered-knight danger, checks, mating nets, interpositions, flight squares, attacker trades, pawn breaks, outposts, passed pawns, and promotion races. The policy selector uses a 10-ary best-first beam for opportunity families; threat and rescue families are always retained. The hot search path also uses incremental bitboards/king locations and an O(1) incremental Zobrist key, so alpha-beta, legal-move validation, and value lookup do not repeatedly rescan the entire board. ## Build on Windows Install GCC and NASM, ensure both are in PATH, then run: ~~~bat build.bat ~~~ The executable is build\NCT_10A5.exe. The Windows build targets x86-64 CPUs with SSE4.2 and POPCNT support. Hash accepts 1 through 131072 MB. Allocation is lazy and falls back to a smaller table when the requested amount cannot be committed; this avoids crashing on machines without enough RAM. Threads accepts 1 through 512. Root parallelism uses no more workers than there are legal root moves, so a request for 512 threads does not create idle workers. ## UCI support The engine supports the standard UCI lifecycle and search commands: uci, isready, setoption, ucinewgame, position, go, stop, ponderhit, and quit. The go parser accepts depth, mate, movetime, clock/increment controls, movestogo, nodes, infinite, ponder, and searchmoves. Completed iterations report a full principal variation with info ... pv ..., and bestmove includes a ponder move when one is available. ## Build on Linux/MSYS ~~~sh chmod +x build.sh ./build.sh ~~~ ## UCI smoke test ~~~text uci isready position startpos moves e2e4 e7e5 go depth 4 quit ~~~ The engine reports: ~~~text id name NCT_10A5 id author Nguyễn Thạch Anh ~~~ Sau đó, viết 1 engine đúng như plan đã nghĩ trên cùng trang viết plan đó và implement đấy đủ nhất trong 2 file .h và .c, dù project tree khuyến nghị hoàn toàn khác, vì bạn viết 1 mẫu chạy đầy đủ tính năng và dùng thuật toán nào nhanh nhất và tối ưu cho cpu nhiều nhất có thể và include openMP.
