Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. Berliner, H.: The B* tree search algorithm: A best-first proof procedure. Artificial Intelligence 12, 23–40 (1979)
2. Buro, M.: Toward Opening Book Learning. International Computer Chess Association Journal 22, 98–102 (1999)
3. Lecture Notes in Computer Science;T. Lincke,2002
4. Beal, D.F.: Mixing heuristic and perfect evaluations: Nested minimax. International Computer Chess Association Journal 7, 10–15 (1984)
5. Cambridge Studies in Advanced Mathematics;R. Stanley,1997
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献