How noxioustab/nox_engine works
Project type and purpose
• This is a stand-alone, command-line UCI (Universal Chess Interface) chess engine written in C++.
• It reads UCI commands from stdin, uses bitboard representation, runs a Minimax search with alpha-beta pruning and NNUE evaluation, then writes best moves back to stdout.
• Purpose: provide a high-performance, modular chess engine core that can plug into any UCI-compatible GUI.
File structure
• Top-level:
• Makefile, README.md, .gitignore
• inc/ — all public headers for different modules
• src/ — C++ implementation files (board.cpp, search.cpp, main.cpp)
• Module breakdown (in inc/):
• noxengine.h: high-level engine API (initialization, UCI command loop)
• .h, board.h: bitboard and board-state management
• generation.h, move.h, tables.h, magicnumbers.h: move generation & attack tables
• search.h: Minimax + α-β pruning orchestration
• heuristics.h, traditional.h, nnue.h: evaluation layers (static + NNUE)
• settings.h, report.h, utils.h, chooser.h: configuration, logging, utility functions
• src/main.cpp: UCI input/output & engine lifecycle
• src/board.cpp, src/search.cpp: core logic implementations
README for additional insights
• Confirms UCI protocol, bitboards, minimax, alpha-beta, NNUE.
• Mentions future options: quiescence search, transposition tables, multithreading.
Detail checklist
• FEN loading and NNUE weight file as external data sources
• Iteration: Search Engine calls Move Generation repeatedly
• Future extension points (quiescence, multi-threading)