• DOI:10.1109/CCDC.2009.5191963
Corpus ID: 20960281

Enhancements of proof number search in connect6

@article{Xu2009EnhancementsOP,
  title={Enhancements of proof number search in connect6},
  author={Changming Xu and Z. M. Ma and Jun-Jie Tao and Xinhe Xu},
  journal={2009 Chinese Control and Decision Conference},
  year={2009},
  pages={4525-4529}
}

Changming Xu, Z.M. Ma, +1 author Xinhe Xu

Published 2009

Mathematics

2009 Chinese Control and Decision Conference

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 naïve 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… CONTINUE READING

View on IEEE

doi.org

Save to Library

Create Alert

Cite

Launch Research Feed