aran wrote:for example :
two cells ab, abc
[...]
A statement can however be made :
either ab will turn out to be a hidden pair, or if that is not the case, then c is true.
When c is false, how is ab hidden?
ronk wrote:aran wrote:for example :
two cells ab, abc
[...]
A statement can however be made :
either ab will turn out to be a hidden pair, or if that is not the case, then c is true.
When c is false, how is ab hidden?
*-----------------------------------------------------------*
| 3 8 67 | 167 256 12 | 257 4 9 |
| 1 25 9 | 678 4 28 | 2578 268 3 |
| 67 25 4 | 3 258 9 | 2578 128 16 |
|-------------------+-------------------+-------------------|
| 4 3 2 | 9 7 6 | 1 5 8 |
| 78 6 78 | 2 1 5 | 3 9 4 |
| 9 1 5 | 48 38 348 | 6 7 2 |
|-------------------+-------------------+-------------------|
| 68 4 138 | 5 238 7 | 9 128 16 |
| 2 7 1368 | 1468 9 1348 | 48 168 5 |
| 5 9 168 | 1468 268 1248 | 248 3 7 |
*-----------------------------------------------------------*
aran wrote:ronk wrote:aran wrote:for example :
two cells ab, abc
[...]
A statement can however be made :
either ab will turn out to be a hidden pair, or if that is not the case, then c is true.
When c is false, how is ab hidden?
With that reasoning, one might as well say that a sudoku consists of 81 naked singles...
daj95376 wrote:Well, since everyone is critique-ing notation, would the following be acceptable as an alternate for ttt's first chain?
[...]
(8)r3c5 - (8=2)r2c6 - (2){r1c56=r1c7-r9c7=r7c8-r7c5} = (38)r67c5 - (8)r3c5 => [r3c5]<>8
ronk wrote:aran wrote:ronk wrote:aran wrote:for example :
two cells ab, abc
[...]
A statement can however be made :
either ab will turn out to be a hidden pair, or if that is not the case, then c is true.
When c is false, how is ab hidden?
With that reasoning, one might as well say that a sudoku consists of 81 naked singles...
aran and I seem to have had problems communicating since day one. Would anyone care to translate that
ttt wrote:Draco, I’m sorry by out of this Topic.
ttt
aran wrote:ronk wrote:aran wrote:ronk wrote:aran wrote:for example :
two cells ab, abc
[...]
A statement can however be made :
either ab will turn out to be a hidden pair, or if that is not the case, then c is true.
When c is false, how is ab hidden?
With that reasoning, one might as well say that a sudoku consists of 81 naked singles...
aran and I seem to have had problems communicating since day one. Would anyone care to translate that
Just in case there's a volunteer translator, I'll wait before giving you the less elliptical version.
Luke451 wrote:The solution read, “(hp38=2)r67c5-…..” That is clear. I can see what was intended. In fact, it is more than clear. We have the extra clarification that that the presenter considered the (38)’s an “hp.” An inference was established, the chain was kicked off, no problem.
here aran wrote:Hidden pair = naked pair with clutter.
Remove the clutter, reveal the naked pair.
Your argument is : ergo, it was always a naked pair. With which I for one disagree.
Applied above : if the clutter is removed from (r8c8+r7c9) there is revealed a naked pair 19. Revealed, so it was hidden.
ronk wrote:here aran wrote:Hidden pair = naked pair with clutter.
Remove the clutter, reveal the naked pair.
Your argument is : ergo, it was always a naked pair. With which I for one disagree.
Applied above : if the clutter is removed from (r8c8+r7c9) there is revealed a naked pair 19. Revealed, so it was hidden.
Firstly, I never said "it was always a naked pair". I would say it was always an ALS or an "almost naked n-tuple", such as the "almost naked pair" in this case.
Secondly, you are mixing two different issues, one issue being whether it's a "cluttered naked n-tuple" or a "cluttered hidden n-tuple" to start with, and the second issue being whether to call it by its cluttered or uncluttered name.
If the starting point is an ALS (cluttered naked N-tuple), where there are N+1 candidate values in N cells, it becomes uncluttered by removing one value from one or more of the N cells. If the starting point is an AHS (cluttered hidden N-tuple), where there are N candidate values in N+1 cells, it becomes uncluttered by removing one of the cells, leaving a hidden n-tuple.
aran wrote:Revelation=>previously hidden.
In the first case what is revealed is a (previously) hidden naked pair.
In the second what is revealed is a (previously) hidden hidden pair.
ronk wrote:Does that mean you think "(np38=2)r67c5-..." would have been less clear?
*-----------------------------------------------------------*
| 3 8 67 | 167 256 12 | 257 4 9 |
| 1 25 9 | 678 4 28 | 2578 268 3 |
| 67 25 4 | 3 258 9 | 2578 128 16 |
|-------------------+-------------------+-------------------|
| 4 3 2 | 9 7 6 | 1 5 8 |
| 78 6 78 | 2 1 5 | 3 9 4 |
| 9 1 5 | 48 38 348 | 6 7 2 |
|-------------------+-------------------+-------------------|
| 68 4 138 | 5 238 7 | 9 128 16 |
| 2 7 1368 | 1468 9 1348 | 48 168 5 |
| 5 9 168 | 1468 268 1248 | 248 3 7 |
*-----------------------------------------------------------*