Hi all,

Working with ttt's AUR idea, I found the same eliminations in a couple of different ways: The first one below is a composite of ttt's logic

Composite summary of ttt's r6c5<>3 elimination. (Note the uncovered 1r6c5).

15 Sets = {3R28 7R28 3C248 5C248 7C248 6N56}

19 Links = {3r169 5r169 7r6 7c56 5n2 19n4 4n8 3b357 5b5 7b19}

2 AURs = [ (37)r26c56 + (37)r68c56 ]

1 Elimiantion r6c5<>3,

A slightly smaller design using a different structure.

13 Sets = {7R28 3C258 5C248 7C28 6N6 3B28}

17 Links = {3r169 5r169 7r6 3c6 7c56 5n2 19n4 4n8 5b5 7b19}

2 AURs = [ (37)r26c56 + (37)r68c56 ]

1 Elimiantion r6c5<>3,

A design that does not use floors, but uses two "walls" in c28.

18 Sets = {3R28 7R28 3C45 5C4 13679N2 6N6 13679N8}

29 Links = {3r169 5r169 7r6 134578c2 7c5 37c6 123579c8 19n4 3b37 5b5 7b19}

2 AURs = [ (37)r26c56 + (37)r68c56 ]

1 Elimiantion r6c5<>3,

If there are floors and walls, then logically the AURs are the windows?

Ttt, again nice work. My program is showing most eliminations need 2 AURs, but I was not sure this is correct. Your logic suggests this is correct.

Thumbs.

Walls.