Andere Kunden interessierten sich auch für
![N-Dimensional Sequential Move Puzzle]( "N-Dimensional Sequential Move Puzzle")
N-Dimensional Sequential Move Puzzle22,99 €![Sion's Minimax Theorem]( "Sion's Minimax Theorem")
Sion's Minimax Theorem25,99 €![Nesting Problems: Exact and Heuristic Algorithms]( "Nesting Problems: Exact and Heuristic Algorithms")
Nesting Problems: Exact and Heuristic Algorithms46,99 €![A Theory of Heuristic Information in Game-Tree Search]( "A Theory of Heuristic Information in Game-Tree Search")
A Theory of Heuristic Information in Game-Tree Search39,99 €![Heuristic]( "Heuristic")
Heuristic22,99 €![A Signal Can Move Faster Than Light]( "A Signal Can Move Faster Than Light")
A Signal Can Move Faster Than Light39,99 €![Next Move, Best Move]( "Next Move, Best Move")
Next Move, Best Move20,99 €
High Quality Content by WIKIPEDIA articles! Alpha-beta pruning speeds the minimax algorithm by identifying cutoffs, points in the game tree where the current position is so good for the side to move that best play by the other side would have avoided it. Since such positions could not have resulted from best play, they and all branches of the game tree stemming from them can be ignored. The faster the program produces cutoffs, the faster the search runs. The null-move heuristic is designed to guess cutoffs with less effort than would otherwise be required, whilst retaining a reasonable level of accuracy.