This allows Fritz to detect weak moves and to avoid searching them in depth, i.e., a null move pruning algorithm. Alpha-beta pruning improves on minimax by ignoring branches of the game tree that do not contribute further to the outcome, thus reducing the number of positions evaluated while still using a fundamentally brute force approach.Īccording to Fritz’ creators Frans Morsch and Mathias Feist, the program is built around another pruning technique known as the null-move search, where one side moves twice (the other side makes a null move). To cut down the tree of possible positions to a number that could be computed in a reasonable amount of time, Deep Blue used an alpha-beta pruning algorithm to narrow its search. Minimax algorithms make computer programs very good at avoiding tactical mistakes and at refuting unsound attacks, but they don’t help with strategy. This approach is based on the minimax method. As each position is evaluated moving forward through the game tree, chess programs choose the position that maximizes the value of the position for its color and the position that minimizes the value of the position for the opposing color.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |