Shannon博弈中的极小链和不可约链
Minimal and irreducible links in the Shannon game
摘要:
我们讨论弱和强链接(“虚拟连接”)在香农游戏。这些链接的一般性质进行了讨论,导致一种方法来找到所有链接的给定大小的适当修剪穷举搜索。这适用于最多11个顶点的图上的链接。我们讨论的概念,减少这样的链接。三个简单的减少被认为是,包括一个,“捷径”,没有以前描述。给出了11个顶点以下的不可约弱链和10个顶点以下的不可约强链的完备集。一些应用程序的分析十六进制的注意。
英文摘要:
We discuss weak and strong links (`virtual connections') in the Shannon game. General properties of these links are discussed, leading to a method to find all links of given size by a suitably pruned exhaustive search. This is applied to links on graphs of up to 11 vertices. We discuss the concept of reducibility of such links. Three simple reductions are considered, including one, the `short-cut', not previously described. The complete sets of irreducible weak links on up to 11 vertices and strong links on up to 10 vertices are presented. Some applications to the analysis of Hex are noted.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。