Akihiro Kishimoto, Martin Müller 0003. About the Completeness of Depth-First Proof-Number Search. In H. Jaap van den Herik, Xinhe Xu, Zongmin Ma, Mark H. M. Winands, editors, Computers and Games, 6th International Conference, CG 2008, Beijing, China, September 29 - October 1, 2008. Proceedings. Volume 5131 of Lecture Notes in Computer Science, pages 146-156, Springer, 2008. [doi]
@inproceedings{KishimotoM08,
title = {About the Completeness of Depth-First Proof-Number Search},
author = {Akihiro Kishimoto and Martin Müller 0003},
year = {2008},
doi = {10.1007/978-3-540-87608-3_14},
url = {http://dx.doi.org/10.1007/978-3-540-87608-3_14},
tags = {completeness, search},
researchr = {https://researchr.org/publication/KishimotoM08},
cites = {0},
citedby = {0},
pages = {146-156},
booktitle = {Computers and Games, 6th International Conference, CG 2008, Beijing, China, September 29 - October 1, 2008. Proceedings},
editor = {H. Jaap van den Herik and Xinhe Xu and Zongmin Ma and Mark H. M. Winands},
volume = {5131},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-87607-6},
}