Difference between revisions of "Open problems"
From HexWiki
m (renaming Javerberg-wccanard problem as Sixth row template problem; fixing link to Jory's problem) |
(Edited categories) |
||
| Line 11: | Line 11: | ||
* Two further open problems are posed by [[Jory]] in the [http://www.littlegolem.net/jsp/forum/topic2.jsp?forum=50&topic=167 Little Golem forum]. | * Two further open problems are posed by [[Jory]] in the [http://www.littlegolem.net/jsp/forum/topic2.jsp?forum=50&topic=167 Little Golem forum]. | ||
| − | [[category: | + | [[category: Open problems]] |
Revision as of 21:25, 28 December 2020
- 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?
- Sixth row template problem: 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.
