Stefan Edelkamp, Peter Kissmann. On the Complexity of BDDs for State Space Search: A Case Study in Connect Four. In Wolfram Burgard, Dan Roth, editors, Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011, San Francisco, California, USA, August 7-11, 2011. pages 18-23, AAAI Press, 2011. [doi]
@inproceedings{EdelkampK11,
title = {On the Complexity of BDDs for State Space Search: A Case Study in Connect Four},
author = {Stefan Edelkamp and Peter Kissmann},
year = {2011},
url = {http://www.aaai.org/ocs/index.php/AAAI/AAAI11/paper/view/3690},
tags = {case study, search},
researchr = {https://researchr.org/publication/EdelkampK11},
cites = {0},
citedby = {0},
pages = {18-23},
booktitle = {Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011, San Francisco, California, USA, August 7-11, 2011},
editor = {Wolfram Burgard and Dan Roth},
publisher = {AAAI Press},
}