By Topic

Enhancements of proof number search in connect6

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chang-ming Xu ; Coll. of Inf. Sci. & Eng., Shenyang, China ; Ma, Z.M. ; Jun-jie Tao ; Xin-he Xu

Based on PN search which is a best first search, a new search algorithm named PN# is proposed in this paper. Being easiest to (dis)prove, the node with least pn or dn is always expanded first in the naive implementation of PN search. However, the frontier nodes can not be sorted by the initialized value of their pn and dn. Especially, the brother nodes is always expanded at the same degree though some of them are superior than others. For above reasons, the domain knowledge is introduced, which makes the key factors to select the nodes to be expanded next is combined with the weight of the moves, besides the threshold pn and dn. Our experiments show that compared with the naive PN, PN# enhances the speed of program, reduces the size of search tree, and strengthens the ability to solve a position.

Published in:

Control and Decision Conference, 2009. CCDC '09. Chinese

Date of Conference:

17-19 June 2009