Talk:Flipping bits game: Difference between revisions
wondering why the random goal state
Simple9371 (talk | contribs) (Hmm...) |
(wondering why the random goal state) |
||
| (5 intermediate revisions by 2 users not shown) | |||
Line 34:
::::Glad to help. I wish I could definitively prove a relationship between the starting and ending position that guarantees a solution. Alas, I don't think my proof skills are quite that good. I suspect that if the starting and ending positions share the same parity for each even-sized subgrid, there is a solution, but I'm not sure I could prove that. [[User:AnonymousJohn|AnonymousJohn]] ([[User talk:AnonymousJohn|talk]]) 01:50, 4 December 2013 (UTC)
:This game is similar to the [https://en.wikipedia.org/wiki/Lights_Out_(game) "All-out"] game... --[[User:Simple9371|Simple9371]] ([[User talk:Simple9371|talk]]) 13:48, 16 June 2015 (UTC)
==Generating a Solvable Game==
I am quite sure that this has been shown already by someone, but I will still share a 'method' of generating a solvable flipping bits game, with some proofs. Here it is: [https://pastebin.com/WZfMeeGw PasteBin]
If there is any error there, just reply.
: You should sign (and date) your comments <nowiki>--~~~~</nowiki> will autogenerate a timestamped signature for you. Also, generating all solvable games would be a different task. (If you feel up to it, you could create a task page for that task...). --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 21:53, 13 May 2017 (UTC)
:: Sorry, I forgot the signature. Just ignore the proof, because it will just prove that the 'fastest' way to generate a solvable flipping bits game is to do what the page recommends you to do (''One possible way to do this is to generate the start position by legal flips from a random target position.''). I mean, no parity tests, etc. --[[User:Simple9371|Simple9371]] ([[User talk:Simple9371|talk]]) 07:45, 14 May 2017 (UTC)
==Why the Random Goal State?==
Wouldn't it be the exact same game (but a bit easier to display and play) if we said the goal state was always all zeros? Obviously we'd still need to generate a valid starting state. But then the player wouldn't have to look back and forth between the two states to see which bits are wrong; she would be just trying to eliminate all the 1's. --[[User:JoeStrout|JoeStrout]] ([[User talk:JoeStrout|talk]]) 05:14, 12 June 2019 (UTC)
| |||