File: pearl2[1].swf-(255 KB, Game)
[_] Anonymous 08/11/12(Sat)12:50 No.1741573
Impossible!
>> [_] Anonymous 08/11/12(Sat)13:07 No.1741588
talks
too
sloowwwwlllyyyyy
>> [_] Anonymous 08/11/12(Sat)13:14 No.1741592
PROTIP: You can't win, not unless the AI is scripted to lose at some point.
>> [_] Anonymous 08/11/12(Sat)13:25 No.1741596
you can win
>> [_] Anonymous 08/11/12(Sat)13:28 No.1741597
>>1741573
>>1741592
Take 4 from 6-row. CPU will take the 5th.
Take 3 from 3-row. CPU will take one from 4-row.
Take 3 from 5-row. CPU will take another from 4-row.
Take the last from 6-row. CPU wa mou shindeiru.
If you can't win from there, kill yourself.
>> [_] Anonymous 08/11/12(Sat)13:28 No.1741598
1. Go first
2. Remove entire row of 4, hit Go
3. After each of his moves, use Windows Calculator in Programmer mode to XOR the totals of all
three remaining rows together, then figure out how many pearls you have to remove from a stack to
reduce the XOR total to zero, remove those pearls unless that would leave all remaining stacks
with one pearl in them
4. If this would, only take enough pearls to leave an odd number of single-pearl stacks (if it's
3-1-1, take 2 from the 3 stack, if it's 3-1, take the whole 3 stack)
5. Take the single pearl stacks remaining until there's one pearl left. You win, and can now stop
playing.
>> [_] Anonymous 08/11/12(Sat)13:36 No.1741600
GUYS, GUYS, you're overthinking it.
If you're just going to follow an algorithm to beat him, just open up two instances of it and
have him play against himself.
>> [_] Anonymous 08/11/12(Sat)13:43 No.1741604
>>1741600
FUCKING BRILLIANT
>> [_] Anonymous 08/11/12(Sat)13:52 No.1741609
This is a classical mathematical game of Nim that has been solved for any heap sizes using
nim-sum algorithm.
In this particular flash, if AI is using said algorithm you can only win if you let him start
first.
>> [_] Anonymous 08/11/12(Sat)13:55 No.1741611
If I recall, someone posted a guide to winning in this that involved treating each row as a
binary number. Can't remember it all, and I can't be bothered to go lurking through swfchan to
find it.
>> [_] Anonymous 08/11/12(Sat)14:02 No.1741613
>>1741609
Nope, the initial XOR of all the rows is 4.
6 ^ 5 ^ 4 ^ 3 = 4
To win, you have to go first, and take enough pearls off one row to change the XOR to zero, which
means removing 4 pearls from row 4, 5, or 6.
>> [_] Anonymous 08/11/12(Sat)14:06 No.1741615
If the initial XOR of all the rows is zero, you can only win by letting him go first. If it was
7-6-5-4, then you would have to let him go first to win.
Basically, when the rows XOR to zero, they can only be XORed to a nonzero number, while if the
XOR is nonzero, there is always a way to make them XOR to zero. This way you can maintain control
of the game, always forcing your opponent to disturb the balance and let you keep re-establishing
it, until the endgame, where you simply make sure that all the rows have only 1 pearl in them,
and there are an odd number of rows when you finish your turn.
>> [_] Anonymous 08/11/12(Sat)14:07 No.1741616
>>1741613
i just noticed yeah.
>> [_] Anonymous 08/11/12(Sat)14:20 No.1741626
Oh yeah, and the end game starts when there is only one row left with more than one pearl in it.
If there are an odd number of rows with a single pearl in them, take the whole row, while if
there are an even number of single-pearl rows (or NO other rows), take all but one pearl.
>> [_] Anonymous 08/11/12(Sat)14:52 No.1741641
Can't beat this motherfucker, does he have rage face? I get the situation, when he was going to
make turn, but then removed hand, is it win?
>> [_] Anonymous 08/11/12(Sat)18:31 No.1741727
Translate the number of pearls in each row into a binary number:
3 = 011
4 = 100
5 = 101
6 = 110
Add up each column, so column 1 is 0 + 1 + 1 + 1 which is 3. Get each column to equal either 0 or
an even number by the end of your turn. So, let's take 4 from the 4th row of pearls, we now get
3 = 011
4 = 100
5 = 101
2 = 010
Now all columns equal 2. Rinse, repeat, win.
