Search Results for "tree"

...It has many interface fixes and improvements, and is fully compatible with Scid's .si4 databases. New features include a rewritten Gamelist, Computer Tournament, and FICS, Tree, Book and Graph improvements.

A free and open source chess database application for Linux, Mac OS X and Windows.

Chess application which allows working with PDFs and PGNs. You can work with the chess games of the PDF and edit their tree of variants. Graphical environment. Standard PGN TAGs. PGN comments. Ocr like (Fen string detection from chess board position images). Connection to Uci chess engines (like stockfish). Position analysis, full game analysis. You can now play games against uci engines. pdf2pgn command line command included. Detailed documentation.

Adrix.NT Java Works :: Sources & Build Projects includes - Paged Lists of Object & Iterators Library for Java - Action / Entity Model for Java - VR Ax AWT Clock Java Component - VR Multi Dimensions Array Library - VR MDArray List Manager Library - VR Adjacency (List | Matrix) Direct Graph Lib - VRJMosaic cells sliding game with automatic resolver - VR RectsWorld Sample Applic - VR Free Chess 2D Applic also contains - Other Utils Libraries - Demo and Test Applications -...

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

Fuego is a collection of C++ libraries for developing software for the game of Go. It includes a Go player using Monte-Carlo tree search.

...Runs a DFS on the Ruzzle grid and at each instance checks if the word formed is a valid one. 2. Since the size of a grid is just 4 x 4, optimizations (such as using a suffix tree) aren't that important. 3. The total list of possible words is obtained fairly quickly. Less than 10 seconds on an i7 machine (without using any form of parallelization or multithreading). 4. The TWL06 wordlist, same as the one used by Ruzzle, is used as the dictionary. 5. The automated swiping is done by controlling the mouse pointer and getting it to move around automatically. ...

Players and solvers for the game of Hex.

BB Arena is a Java Open Source version of a fantasy football game, that allow roster creation, network play, match report generation and easy rules customization. Project migrated to https://github.com/Teg79/BBArena/tree/develop

Chess Training Tools including tools for chess visualization training, analysis tree training, and opening training.

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

Play Gomoku against computer player. The computer player is implemented using a min/max tree with alpha-beta pruning.

This is a program able to play the connect-four game, using a minimax tree search. The interesting part is that the search tree is independent of the heuristic and can be reused. Is written in compiled java.