Skip to content
#

move-ordering

Here are 17 public repositories matching this topic...

Jungle Chess: Chess Game Engine - Implementation of Minimax, Alpha-Beta Pruning, Move Ordering, and Quiescence Search - SUSTech project of course CS109: Introduction to Programming in Spring 2023 - Score: 110/100

  • Updated Aug 4, 2023
  • Java

A C# chess engine evolution project — from basic alpha-beta to a tuned engine with TT, LMR, NMP, RFP, quiescence, and Texel-tuned evaluation. Documents each development stage with versioned releases and UCI support.

  • Updated Oct 22, 2026
  • C#

This project presents an AI-driven Othello (Reversi) game designed to compare multiple algorithms, including Minimax, MCTS, A*, Q-Learning, and Negamax. It demonstrates various difficulty levels, which introduce controlled randomness to the AI for a more dynamic gameplay experience.

  • Updated Apr 21, 2025
  • Python

Add this topic to your repo

To associate your repository with the move-ordering topic, visit your repo's landing page and select "manage topics."

Learn more