001800730024603009000001005007132698000765000162948000806310000273586941015007000
In this puzzle u will see
- Code: Select all
...|...|...
...|...|...
379 38 89|...|...
...|...|...
39 38 89|...|...
...|...|...
...|...|...
...|...|...
...|...|...
I know it will be solved easily as 6 is hidden in r1c1, opening a naked pair in c9. But looking in r3 and r5, we can say, 7 must be in r3c1, as omitting it would make the puzzle invalid.
I thought it as a extended version of UR. You may call it BUG lite, too.
But suppose this pattern
- Code: Select all
...|...|...
...|...|...
abc abc abc|...|...
abcd abc abc|...|...
...|...|...
...|...|...
...|...|...
...|...|...
...|...|...
Omitting d in r4c1 may cause the puzzle invalid as we might get more than 2(12!!) solution, so r4c1='d'.
This is not a BUG, But I think it may be a uniqueness test.
If it hasnt been discovered or not, I wont call it a TUG(Triivalue UG), but i think it can be renamed under a class "Generalised Universal Grave" or GUG. The LITE version of all Uniqueness tests can be named as "Generalised Localised Grave" or GLOG.
If it has been discovered, please reply with the name of the thread it had been discussing with the author name. I need some example.
Please forgive me if i am wrong. I am still learning....
