Timeline for Monday's Unmatched Donimoes Problem
Current License: CC BY-SA 4.0
9 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jul 22, 2019 at 15:49 | history | edited | Gareth McCaughan♦ | CC BY-SA 4.0 |
a different variety of oops, perhaps
|
Jul 22, 2019 at 15:48 | comment | added | Gareth McCaughan♦ | Ah, but maybe -- of course I can't remember now -- I actually intended my "32 left" to mean moving it left twice, in which case rather than being bad because it's invalid my solution was bad because it duplicated an existing one. (I just noticed that the numbers of moves were substantially different and didn't check what Stiv's actual moves were. My bad.) | |
Jul 22, 2019 at 15:46 | comment | added | Gareth McCaughan♦ | I hope not, since mine was invalid :-). | |
Jul 22, 2019 at 15:44 | comment | added | LeppyR64 | Are these not the same solutions except Gareth's solution compresses duplicate 1-space moves into one move? Stiv has 32L 32L where Gareth has 32 L. Stiv has 10L 10L 10L where Gareth has 10L. | |
Jul 22, 2019 at 15:44 | history | edited | Gareth McCaughan♦ | CC BY-SA 4.0 |
oops
|
Jul 22, 2019 at 15:43 | comment | added | Stiv | Got me a few times too! I have a solution in 12 but not sure if it can be done in fewer... | |
Jul 22, 2019 at 15:42 | comment | added | Gareth McCaughan♦ | Yow, so it does. I thought I'd checked for that, but obviously not. Good catch. | |
Jul 22, 2019 at 15:41 | comment | added | Stiv | But then your second move breaks the 'Stay connected' rule since 'diagonal connections don't count'... The 10/32 block ends up separated from the rest... | |
Jul 22, 2019 at 15:39 | history | answered | Gareth McCaughan♦ | CC BY-SA 4.0 |