Search Results for "minimax algorithm"

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...

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 a LabVIEW implementation of the Tic Tac Toe game. Players can be human or AI. The AI has two settings: dumb and intelligent. The dump setting places tokens by random, the intelligent setting plays the best possible move by running a MiniMax algorithm. The executable requires the LabVIEW Run-Time Engine 2014 - (32-bit) available for download here: http://ftp.ni.com/support/softlib/labview/labview_runtime/2014/Windows/f2/LVRTE2014f2std_downloader.exe

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!

This simple chess engine employs a minimax algorithm to calculate two moves ahead.

This is a small and simple project which i used to work on creating a minimax algorithm. In its current state, the algorithm is finished. Future updates will try to: 1. Add heuristics instead of just checking for wins 2. Introduce alpha-beta pruning Other updates not concerning the AI will be: 1. Coins will fall down into place, instead of appearing 2. You can set if you want to play with 2 humans, 2 computers or an AI and a human. 3. You can select different AI's Lots of work...

Dots&Boxes is becoming a super-charged multiplayer game based on the traditional Dot Game first published in 1889 by Édouard Lucas. This standalone version uses the minimax algorithm with alpha-beta pruning to enhance the computer game difficulty.

Checkers board game with official brazilian rules. The game engine uses an endgame database with up to 4 pieces. Many optimization techniques were used to generate and process the game tree tree and minimax algorithm. Bitboards and zobrist keys are also used.

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.

Another project based on the famous Tic-Tac-Toe game. The AI is based on the Minimax algorithm. Design: Julian Kuntorov ( http://juliank.eu/ ) , Development: Me :)

Reversi game with minimax algorithm

Color Expansion board game, built on generic minimax algorithm. This program is a member of Color Expansion AI's contest.

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.