Search Results for "minimax algorithm"

MiniMax-M1 is presented as the world’s first open-weight, large-scale hybrid-attention reasoning model, designed to push the frontier of long-context, tool-using, and deeply “thinking” language models. It is built on the MiniMax-Text-01 foundation and keeps the same massive parameter budget, but reworks the attention and training setup for better reasoning and test-time compute scaling. Architecturally, it combines Mixture-of-Experts layers with lightning attention, enabling the model to...

Blind Chess also known as "Dark Chess" (暗棋) or "Banqi" or Half Chess , is a two-player Chinese board game played on a 4x8 grid, or half of the xiangqi (Chinese Chess) board. This application is using Taiwan rule. AI is using basic minimax tree structure and some rules. Advanced algorithm such as Upper Confidence bounds applied to Trees and Monte Carlo Tree Search are NOT used. This app is single player vs computer only. For English user, Christakis Giorgios made Software Requirements Specification(pdf file) for old version, it will help anyone that downloads old application to understand basic blind chess and use it. ...

Algerian / Spanish Checkers Variant is a digital implementation of the classic board game with unique features and rules. Currently, the program integrates an AI opponent using the Minimax algorithm with alpha-beta pruning. The previous versions just favours moves that result in the fewest captures for the opponent. Future versions will include more sophisticated AI to enhance gameplay. The program currently handles all kind of regular piece and dama moves and captures.

Self chess learning process by artificial neural network white random attribution to of values of chess game, before to pass opposed value to neural network and the desire successor of board with various part of game chess generated with minimax algorithm.

This is an implementation of the classic Tic Tac Toe game on the Hack computer as part of the Nand2Tetris project. The game features a 1 or 2-player mode with a computer-controlled player for single player games. The computer AI uses a 'minimax' algorithm and has 3 levels of difficulty - the Impossible mode is unbeatable!

Artificial Intelligence Connect 4 Game using minimax search algorithm

A start of Hockey Demo. The intelligence of the players is using AI techniques, such as MiniMax algorithm.

Open source clone of the board strategy game blokus, mainly the duo (1vs1) mode. Each player has 21 pieces to put on the board while preventing the opponent from doing the same. Also features solo or 4 players games and an expandable challenge mode.

Reversi game with minimax algorithm

S7r47e50 is an attempt to write a version of Stratego for Linux in Ruby using mySQL for 'opening books', a minimax algorithm as the AI, and TCP/IP bindings for internet multiplayer options. It will be licenses under the GPL v2.