Search Results for "simple decision tree"

GEDKeeper program is developed for work with personal genealogical database. The program is designed for extremely simple and intuitive interface. The program is very easy to install on the computer, fully supports the GEDCOM format, has no restrictions on the number of persons and generations, allows you to generate pedigrees, building several tree species, as well as print and save their images, provides fast navigation, filtering, searching and adding multimedia materials. ...

...The game mimics the traditional backgammon game. The game engine consists of a main Python code (tavla.py) and two auxiliary AI files. These AI files are essentially simple Python scripts containing decision-making mechanisms. They can roll dice and randomly decide what to do by determining the positions of the pieces. Then they make their moves. This program was completed through human effort and artificial intelligence support. Github: https://github.com/shampuan/Demli-Tavla

This utility extracts a Quake engine .PAK file to a directory tree, and also builds a .PAK file from a directory tree. This tool is a simple one-step solution to deconstruct and reconstruct Quake engine games .PAK files.

darkforestGo is an early deep-reinforcement-learning Go engine that combined a convolutional policy/value network with Monte Carlo Tree Search (MCTS) to play the full 19×19 game at a strong amateur level. The system couples fast GPU policy inference with CPU or GPU-assisted tree search so priors from the network guide exploration while search refines local tactics. Training pipelines mix supervised learning from human professional games and self-play fine-tuning, allowing the model to learn opening patterns and endgame tactics beyond simple pattern libraries. ...

A Java tool that allows a gamemaster to manage notes, characters, combat, images, sounds, etc. on his computer during gaming sessions. Plugin-based to allow using it with various rpg system, such as Shadowrun, GURPS, TDE, D&D, etc.

...The read-write head itself is a state engine, which is affected by the input from the track, and which decides what to write on the track, and where to read the next input, by "moving" the head back or forth. In 5050, the part of the track left of the head is represented not by a line or stack of information, but by a binary tree. The part right of the head is represented by a binary tree, too. The head itself sort of sits between the two trees, but will often change its state according to information from the right side of the left side. In 5050, the state of the head itself is again represented as a tree of commands, although for simple programs, a linear representation can be sufficient.

An app for quickly building collections and rating them. Test at www.wudiware.com/emmaframe.php Should be good for games and communication. Lots left to add. Try the "cuteness challenge". Ideas welcome (emma should be good at idea dev. too).

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