1.2

Minor improvements to the search function

Nexa v1.0 - Initial Release

This is the initial release of Nexa, a simple UCI chess engine written in C++ made solely using AI.

Features:

• Basic board representation and initialization.
• Pseudo-legal move generation for all chess pieces (pawn, knight, bishop, rook, queen, king).
• En passant and castling implemented.
• Basic FEN position setup.
• UCI protocol support for communication with chess GUIs.
• Basic material evaluation function.

Known Limitations:

• The engine's search is basic and can be easily outplayed.
• Alpha-beta pruning is not yet implemented, so the search is slow.
• Check detection and checkmate/stalemate detection are not fully implemented.
• The evaluation function is very simple (material only).
• Castling rights and en passant fields are ignored in FEN parsing.
• Pawn promotion is auto-queening.

Installation:

1. Clone the repository.
2. Compile the source code using a C++ compiler (e.g., g++): g++ main.cpp -o axiom
3. Run the executable on a GUI such as Arena chess.

Usage:

Load Axiom on a windows GUI such as Arena Chess to play with it.

Credits:

• Author: Sambros aka VoidWalkerDev

Future Improvements:

• Implement alpha-beta pruning.
• Improve the evaluation function.
• Add check detection and checkmate/stalemate detection.
• Implement more advanced search techniques.
• Add better FEN parsing.
• Add better pawn promotion selection.

Assets:

• axiom (windows executable)
• main.cpp (source code)