Computer Science – Artificial Intelligence
Scientific paper
2008-08-08
ICGA Journal, International Computer Games Association, Vol. 25, No. 3, pp. 153--161, September 2002
Computer Science
Artificial Intelligence
9 pages
Scientific paper
In this article we review standard null-move pruning and introduce our extended version of it, which we call verified null-move pruning. In verified null-move pruning, whenever the shallow null-move search indicates a fail-high, instead of cutting off the search from the current node, the search is continued with reduced depth. Our experiments with verified null-move pruning show that on average, it constructs a smaller search tree with greater tactical strength in comparison to standard null-move pruning. Moreover, unlike standard null-move pruning, which fails badly in zugzwang positions, verified null-move pruning manages to detect most zugzwangs and in such cases conducts a re-search to obtain the correct result. In addition, verified null-move pruning is very easy to implement, and any standard null-move pruning program can use verified null-move pruning by modifying only a few lines of code.
David-Tabibi Omid
Netanyahu Nathan S.
No associations
LandOfFree
Verified Null-Move Pruning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Verified Null-Move Pruning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Verified Null-Move Pruning will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-29100