MinMax with Alpha

How can MinMax with Alpha-Beta Pruning be applied to the game Stratego? Can you simulate how it works. Thank you!

---

Stratego is not a game of perfect information, making much more expensive to solve with Alpha-Beta. The approach I learnt goes roughly like this:

For each opponent piece on the board that could be targeted during a turn,

For each type of piece the opponent controls,

Work out the probability that the given piece could be of the given type,

If the probability is greater than 0 then add the node to your search tree.

Weights get multiplied by probabilities for working out which move to select.

To be work out the probabilities. The AI would keep track of the type of each piece revealed, as well as each piece removed, allowing it to better infer the type of unknown pieces. Obviously, any revealed piece would have a type probability of 1, since the AI knows what it is.

链接地址: http://www.djcxy.com/p/56372.html

上一篇: 生成游戏树

下一篇: 带有Alpha的MinMax