книги Наука, техника, медицина Гуманитарные науки Общественные науки Социология Прикладная социология

Alpha–beta pruning

Код 3296587

  • ISBN: 978-5-5145-9335-4

Нет в продаже

Аннотация к книге "Alpha–beta pruning"

High Quality Content by WIKIPEDIA articles! Alpha–beta pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree. It is an adversarial search algorithm used commonly for machine playing of two-player games (Tic-tac-toe, Chess, Go, etc.). It stops completely evaluating a move when at least one possibility has been found that proves the move to be worse than a previously examined move. Such moves need not be evaluated further. When applied to a standard minimax tree, it returns the same move as minimax would, but prunes away branches that cannot possibly influence the final decision.

Оставить комментарий

Оцените книгу:

ISBN: 978-5-5145-9335-4

Книга находится в категориях

Машиностроение Отраслевая экономика

Вместе с этой книгой покупают

Просмотренные товары