资源分类
》 资源 》论文》Solving 8×8 Hex

Solving 8×8 Hex

2019-11-15 | |  98 |   39 |   0

Abstract Using effificient methods that reduce the search space, we design an algorithm strong enough to solve all 8×8 Hex openings

上一篇：Minimum Proof Graphs and Fastest-Cut-First Search Heuristics

下一篇：New Improvements in Optimal Rectangle Packing

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...