| Name : perl-Games-AlphaBeta
| |
| Version : 0.4.7
| Vendor : obs://build_opensuse_org/devel:languages:perl
|
| Release : lp155.6.1
| Date : 2023-07-20 15:53:50
|
| Group : Development/Libraries/Perl
| Source RPM : perl-Games-AlphaBeta-0.4.7-lp155.6.1.src.rpm
|
| Size : 0.05 MB
| |
| Packager : https://www_suse_com/
| |
| Summary : game-tree search with object oriented interface
|
Description :
Games::AlphaBeta 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 the Games::AlphaBeta::Position manpage which is
a base class you can use to implement your position object.
|
RPM found in directory: /packages/linux-pbone/ftp5.gwdg.de/pub/opensuse/repositories/devel:/languages:/perl:/CPAN-G/15.5/noarch |
