Current status

In its current state ChessJvO features the following components:

• The main search is an Iterative Deepening Depth-First Search (IDDFS.)
• The search type is Negamax, a simplified version of Minimax.
• Alpha–beta pruning is applied to reduce the Branching factor.
• Moves are ordered in various ways. More about this later.
• The board is represented Square centric in 10x12 format.
• A Transposition Table is used to cache intermediate results.

Some additions I'd like to add are:

• History Heuristic.
• Null Move Pruning.
• Multithreading and usage of the GPU.