Sixth row template problem
As of January 2009 the following problem is still open. Javerberg-Wccanard Problem is simply put as follow.
Is there any one stone sixth row template ?
It is still unknown whether one stone edge templates can be found for every heights. Such templates have been found for sizes up to 5 but none above. Answering with "No" to the former question answers the latter.
Contents
Description
Is there a width n such that the game on the board of width n designed as follow with turn to Blue is won by Red ?
Generalisation
The general problem of knowing if there is n such that there is no one stone edge template on the n^th row<math>n^th</math> is also referred to as Javerberg-Wccanard Problem.
Possible paths to answer
Computer Aided demonstration ...
... answering "Yes"
Such a proof would use the computer to find the template and it's carrier. Afterwards it should be easy to manually check that every Blue intrusion does not prevent Red from connecting to bottom.
... answering "No"
TODO
See Also
External link
- The thread were the names were associated.
