Search Results for "algorithm"

Beyond its much publicized success in attaining superhuman level at games such as Chess and Go, DeepMind's AlphaZero algorithm illustrates a more general methodology of combining learning and search to explore large combinatorial spaces effectively. We believe that this methodology can have exciting applications in many different research areas. Because AlphaZero is resource-hungry, successful open-source implementations (such as Leela Zero) are written in low-level languages (such as C++) and optimized for highly distributed computing environments. ...

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), it will help anyone that downloads this application to understand basic blind chess and use it. You can download this pdf in Files->Specification folder.

...run the game from dist folder with java -jar tablut.jar Implemented By University of Windsor computer science students during Introduction to Artificial Intelligence course taught by Professor Kalyani Selvarajah. Please read the White Paper pdf for full game rules and description of CPU player artificial intelligence. CPU player chooses its moves using a minimaxer algorithm with alpha/beta pruning, using an evaluation function that considers 5 different board features.

Simple or complex game

This project is an application of POSM algorithm on Chinese chess computer player. A computer player is implemented, which will adapt to the its opponent by adjusting its playing strength accordingly.

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!

Phantoms Chess Where Pawns Can become Queens Chess Game is zero-sum two-player. Team Members: Phantoms Team * Leader Gehad Sayed Kaseb Gehad.Kaseb@gmail.com * Co-leader Rawia Ahmed * Research team Hagar Samir Safaa Mohamed * Design and Implementation team Ahmed Helal Aya Eid Aya Tarek Eman Saleh Fatma El zhraa Ibrahim Hanan Mohamed John Samir Mina Victor Nahla Ibrahim Samira Magdy Samr Ayman * Integration Team Marwa Ayman Nahla Essam * Interface...

GeneThello (read jə-ˈne-ˈthe-lō), is an acronym for genetic othello, an othello (reversi) playing program which based on Genetic Algorithm (GA). In principle GeneThello consist of an othello program and a genetic algorithm system.

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.

A framework for creating board games and card games using a minimal amount of Java programming and playing them against AI or human opponents.

Reversi game with minimax algorithm

Classic game solved with MinMax algorithm (full solution tree) and simple Heuristics. Specially for learning and teaching computer AI

The algorithm used by this MasterMind applet is very simple. Yet it is also very fast and it uses relatively few guesses.

This is an attempt to make a X vs. O game, without using a back-tracing, or any other time wasteful algorithm. Instead, an arrays of bonuses are used. Bonuses are given for each move, after which empty fields are sorted.

A word game featuring double-letter score, triple-word score, etc. You play against the fast and furious robot. 100% Java. The project could use a look-ahead algorithm and some better choices of dictionaries.

A Go-playing program written in Java. Extensive support for graphical inspection of internals of strategy generation algorithm.

A java implementation of the board game SUSAN(tm), invented by Stephen Linhart in 1991. Network features. Computer algorithm.

A Chinese chess Java Applet using alpha-beta game algorithm. The code can be easily used to program other chess game by changing the chess rules.