<!--[if lte IE 6]>
If you read this it's probably because the world has rebooted. I don't know how but you arrived here. I'm sorry you cannot enjoy this little game but you will be able to in the not too distant future. Browsers will become incredibly better. Just before the world turns into chaos due to Nutella production shortages. Scientists will realise too late that Nutella was to humans what pollen is to bees. Don't believe the hype, the end didn't (or won't) happen because the 'left-pad' package got removed from NPM. Good luck.
1. I want to pay you for this.
2. It will be ripped off a dozen ways, and I would rather see you make money rather instead of some horrible knockoff app-vendor.
On Android + Chrome, a banner will popup to install it as PWA on your phone and you won't see the difference. I believe you are on iOS? I wish Safari iOS was better at following the new web feature (like WebRTC...)
Thanks for your feedback, that's pretty cool!
Cirulli himself described 2048 as a clone of Veewo Studios' app 1024, who has actually said in the description of the app to be a clone of Threes.
Fun game, interesting idea and nicely done! I'll probably play a few more rounds when I get home.
nice time-waster :-)
I imagine 1-2-3-4 would help my confusion a bit. It's weird though, i know it doesn't work that way, but i kept thinking that.
It seems the optimal strategy is to initially try to ferret out which dots are in the solution set and which are not in the solution set via broad non-overlapping sweeps followed by slight pattern deviations to determine membership of particular dots. Depending on luck and your errors, this might take a half dozen moves, it might take two dozen.
Once you know which dots are in the solution set and which are outside, I find it takes less than 5 additional moves to determine order. For this part, a pencil and paper for tracking the elimination of certain dots from certain orders made this phase consistently quick.
Is very fun, I was ultimately able to beat the medium difficulty setting in an average of 15 attempts per game.
"Lock found in 20 attemps. You must hate this game by now."
PS: Pull requests are welcome ;-) https://github.com/maxwellito/breaklock
It's surprising how effective Knuth's algorithm is. If I recall 4 or 5 guesses to solve 4 digit mastermind.
[1] Computer Recreations, Software – Practice & Experience 1.2, 201-204 (Apr-Jun 1971) [2] D.E. Knuth, The Computer as Master Mind, J. Recreational Mathematics Vol. 9 (1976/7)
Interestingly, I find I'm using some similar logic to what I use playing Minesweeper. "Three of this quartet are in the pattern, one of this quartet is in the pattern, they overlap in two places, therefore the two non-overlapped points in the three-scoring quartet must be in the pattern."
First try took 19 attempts, second try took 13 and I think I can do better.
This Quora thread contains some interesting breakdowns of the number of possible patterns that Android permits.
https://www.quora.com/Android-operating-system-How-many-comb...
If we assume that you don't know the number of points in use on a phone you're trying to unlock, the consensus seems to be there are in the region of 390,000 distinct patterns. One correspondent doubled that.
In the case where you know the pattern has 4 points, the number of valid permutations was calculated to be 1624. Your 22 attempt crack is well short of that figure so I think you are being harsh on yourself by implying you basically just got lucky. You're good at this!
0 1 2
3 4 5
6 7 8
Then an L shaped pattern would be the string 0367.
The main idea is that you first build a list of every possible combination of legal moves. Then you take a random guess from that list and you will get back the number of white and black dots.
Now, since you know your random guess and the right answer produces X white dots and Y black dots, you can remove from the list of possible combinations every combination that has: dots(myGuess, combinations[i]) != (X, Y)
you can keep taking random guesses from this list and filtering after each attempt until you get the right answer, I'm not sure of the math but I think worst case It'll be 6-7 moves to find the right answer.
After you excluded all "bad" nodes, you need to find the order. finding the order with the help of "bad" nodes was also faster for me
I went from 56 to a lucky 5 tries.
only 49 tries for me. lol