Difference between revisions of "Open problems"
From HexWiki
(ref to problems posed on LG) |
m (unified inner links : hex board -> board) |
||
| Line 1: | Line 1: | ||
* Are there cells other than a1 and b1 which are theoretically losing first moves? | * Are there cells other than a1 and b1 which are theoretically losing first moves? | ||
| − | * Is it true that for every cell (defined in terms of direction and distance from an [[acute corner]]) there is an ''n'' such that for any [[ | + | * Is it true that for every cell (defined in terms of direction and distance from an [[acute corner]]) there is an ''n'' such that for any [[Board]] of size at least ''n'' that cell is a losing [[opening move]]? |
* Conversely, is it true that, for example, c3 is a winning first move on every Hex board of size at least 5? | * Conversely, is it true that, for example, c3 is a winning first move on every Hex board of size at least 5? | ||
Revision as of 12:03, 3 December 2007
- Are there cells other than a1 and b1 which are theoretically losing first moves?
- Is it true that for every cell (defined in terms of direction and distance from an acute corner) there is an n such that for any Board of size at least n that cell is a losing opening move?
- Conversely, is it true that, for example, c3 is a winning first move on every Hex board of size at least 5?
- Does there exist an edge template which guarantees a secure connection for a piece on the sixth row?
- Is the center hex on every Hex board of odd size a winning opening move?
- Two further open problems are posed by Jory in the Little Golem forum.
