🔍 Monitor network activity in real-time with LazyNet, a terminal-based tool that provides clear insights and management for processes and connections.

🎮 Build and test a simple Tic-Tac-Toe game while learning unit testing, GitHub workflows, and handling merge conflicts effectively.

KANISA ('think'/'réfléchir'): A library for advanced computational studies in optimisation, decision analytics, numerical analysis, dynamic systems and machine learning / Une bibliothèque pour les études computationnelles avancées en optimisation, analyse décisionelle et numérique, systèmes dynamiques et apprentissage automatique

Ensemble d’algorithmes classiques d’intelligence artificielle couvrant la recherche de solutions, les jeux adversariaux, les méthodes d’optimisation et l’apprentissage supervisé, avec des implémentations pratiques.

A chess engine written in C

Chess engine

A complete open-source chess game with AI opponent, move evaluation, and beautiful UI. Built with Python and Pygame.

A modular Python AI game engine for K-in-a-Row variants featuring an adversarial agent with Alpha-Beta pruning, Zobrist hashing, and dynamic LLM-powered commentary via Google Gemini.

UCI Chess Engine written in C++

Sanmill is an open-source, UCI-like Mill/Morris/Merrills/Mühle/Malom (and its variants) program with CUI, Flutter GUI and Qt GUI, sharing and freely distributing the code, tools and data needed to deliver this mill game. We do this because we are convinced that open software and open data are key ingredients to make rapid progress.

V7P3R is a Python-based chess engine for analysis and AI gameplay, featuring my in house built, fully configurable evaluation engine, PGN/JSON data handling, and complete UCI compliance. This is where it all started.

🪁🎯 Kite - Java Connect Four solver

High-performance Chess Engine in C. Features Minimax AI with Alpha-Beta Pruning, Move Ordering optimization, and dynamic heuristic evaluation.

A chess engine written in c++

[NeurIPS 2023 Spotlight] LightZero: A Unified Benchmark for Monte Carlo Tree Search in General Sequential Decision Scenarios (awesome MCTS)

This project is a reference implementation of the method proposed in the paper "Mastering Othello with genetic algorithm and reinforcement learning".

👻 🎮 This is my implementation in the famous Berkeley pacman artificial intelligence project: http://ai.berkeley.edu/project_overview.html.

Implementation of the game Othello in Python with a console interface using alpha-beta pruning.

Strong neural-network chess engine written in C++

A modern Chess Game built in Python (Tkinter) with a beautiful GUI, Bot opponent using Minimax + Alpha-Beta pruning, move history, timers, board flipping, sounds, and more!