![]() ![]() I'll grant you that this is enough different from simple colouring to warrant a separate name. If you start on a particular square and end up on that same square at the end of a strong link (with an odd square count, starting as I do with zero), then it seems to me you have a Discontinuous Alternating Nice Loop situation, and the candidate in question (in this case, an 8) must be the solution, so other candidates in the start/end cell (in this case, one candidate, a 6) can be eliminated. However, it seems to me that it can be solved with a simple extension of the simple-colouring technique. I can answer part of my own question in my last post: the second X-cycle in the third X-cycle exemplar is not a straight simple-colouring problem. ![]() However, the solver will return very positive red and green highlighting but that's because it has discovered one of those four ways first and discarded the other three identical ways. I've deliberately used neutral colours in the diagram above (yellow and blue) not to given the impression there only one way to write the same chain.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |