diff options
Diffstat (limited to 'games/p5-Games-AlphaBeta/pkg-descr')
| -rw-r--r-- | games/p5-Games-AlphaBeta/pkg-descr | 18 |
1 files changed, 9 insertions, 9 deletions
diff --git a/games/p5-Games-AlphaBeta/pkg-descr b/games/p5-Games-AlphaBeta/pkg-descr index faa61e4..efd810e 100644 --- a/games/p5-Games-AlphaBeta/pkg-descr +++ b/games/p5-Games-AlphaBeta/pkg-descr @@ -1,14 +1,14 @@ -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 +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 Games::AlphaBeta::Position which is a base class you can +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 Games::AlphaBeta::Position which is a base class you can use to implement your position object. WWW: http://search.cpan.org/dist/Games-AlphaBeta/ |
