P5-games-alphabeta

Jul 20, 2023

Game-tree search with object oriented interface

GamesAlphaBeta provides a generic implementation of the AlphaBeta game-tree search algorithm also known as MiniMax search with alpha beta pruning. This algorithm can be used to find the best move at a particular position in any two-player, zero-sum game with perfect information. Examples of such games include Chess, Othello, Connect4, Go, Tic-Tac-Toe and many, many other boardgames.

Users must pass an object representing the initial state of the game as the first argument to new. This object must provide the following methods copy, apply, endpos, evaluate and findmoves. This is explained more carefully in GamesAlphaBetaPosition which is a base class you can use to implement your position object.



Checkout these related ports:
  • Ztrack - Simple ncurses based pseudo-3D driving game
  • Zoom - Z-Interpreter for X with full V6 support
  • Zhlt - Zoner's Half-Life compile tools
  • Zephulor - Side scrolling arcade game
  • Zdoom - Source port for Doom-engine games
  • Zaz - Puzzle game where the player has to arrange balls in triplets
  • Zatacka - Nibbles-like multiplayer game
  • Zangband - Zangband (Zelazny Angband) with color, X11 support
  • Yquake2 - Improved version of Icculus Quake II
  • Yahtzee - Curses version of the dice game for one or more players
  • Yadex - WAD file editor, for games like Doom and Heretic
  • Xzip - Infocom game interpreter that runs under X11
  • Xye - Puzzle games like sokoban or boulderdash
  • Xworm - Classic game with apples and hungry worm
  • Xvmines - Simple minesweeper game for X Window System