File: Pearls Before Swine.swf-(147 KB, 640x480, Other)
[_] You Should Be Able to Solve This Anon 3350178 Some notes to help people win: There are three easily-achievable unwinnable scenarios, which occur when you have to remove pearls and the field consists of: >a row of 3, a row of 2, and a row of 1 >two rows with the same number of pearls >three rows with one pearl each If you think carefully, you can work out the best possible first move, and it's easy from there.
>> [_] Anon 3350182 Do his animations mean anything? After my first move, he used to scratch his head, which made me think I was doing good. But now he just goes "aha!"
>> [_] Anon 3350188 >># I tried to work that out. I think it's supposed to mean something, but wasn't programmed in quite right. He laughs even when you're on a good path, but his responses seem to be very consistent when presented with the same field. He still plays perfectly, though.
>> [_] Anon 3350192 How old is this? I played this when I was super young.
>> [_] Anon 3350194 ez done his eyes get wide then he just fucks off and doesnt come back
>> [_] Anon 3350199 If you take out 2 of the pearls from the row with 3, you can force him into a 1-2-3 position, and it's an easy win from there.
>> [_] Anon 3350201 1. Take 2 from A (top row of 2). 2. Jerk takes 1 from B (second row of 4). 3. Take 3 from C (botton row of 5). 4. Douche takes 1 from B. 5. Take remaining pearl from A. 6. Asshole takes 1 from B. 7. Take remaining 2 from C. 8. ???? 9. PROFIT!!!
>> [_] Anon 3350227 >># I played a similar game from these guys called 'chasm'. http://transience.com.au/indexflash.html Here's the flash area of their website, hope it never goes down.
>> [_] Anon 3350232 OP here, I've spent a little time studying the game since I posted the flash. This is based on an ancient game called Nim. There's some pretty basic binary math you can do to solve for any number of rows of any length. For example, using this game: 3 in binary -> 011 4 in binary -> 100 5 in binary -> 101 To work out the move you want to make, take the 'nim sum' of the rows, which is basically working out whether each column has an even or odd number of 1s: 011 100 101 ------- 010 (the first column has an even number of 1s -> 0, while the second column has an odd number of 1s -> 1, etc.) To work out what play you want to make, you want to make it so that the 'nim sum' is 0. In this case, it can only be done by reducing the "011" row, since reducing either of the other two rows would result in the 'nim sum' starting with a 1. For a game with 4 rows, with 3, 4, 5, and 6 pearls (this is the layout for Pearls Before Swine II): 011 100 101 110 ------- 100 So your first play can be to remove 4 from any row.
>> [_] Anon 3350233 >># Reading through this again, I can make it a bit more clear. In the first game, reducing the top row by 2 results in 001 100 101 ------ 000 Which is what you want, since reducing the nim sum to 0 is how you win. In the second game, removing 4 pearls from the bottom row (or either of the other two rows with at least 4 pearls) yields 011 100 101 010 ------ 000 etc.
>> [_] Anon 3350235 >># Didn't work Start 011 100 101 ----- 010 First I took 2 from the first row 001 100 101 ----- 000 Then he took 1 from the second row 001 011 101 ----- 111 Then I took all from the second row 001 000 101 ----- 000 and then the faggot took all from the third row and I was left with the last one in the first row
>> [_] Anon 3350236 >># >>Then I took all from the second row >001 >000 >101 >----- >000 This is where you went wrong. This adds up to 100. 001 011 101 ------ 111 Remove 3 from bottom row 001 011 010 ----- 000
>> [_] Anon 3350237 >># fug
>> [_] Anon 3350251 >># well it's gone

File: Pearls Before Swine.swf-(147 KB, 640x480, Game)
[_] Anon 3349040
>> [_] Anon 3349043 Top 2 Bottom 3 Top 1 Bottom 2
>> [_] Anon 3349056 >># that was way more enjoyable than it had any right to be
>> [_] Anon 3349058 https://www.youtube.com/watch?v=dUXW3Kh_ kxo&feature=youtu.be&t=1m54s
>> [_] Anon 3349060 heeeeeeeeeey this is a blast from the past. Thanks OP!
>> [_] Anon 3349069 >># No prob bud, I just randomly remembered it and thought I'd share :)

File: pearls.swf-(147 KB, 640x480, Game)
[_] Harder then it looks. Anon 2226795
>> [_] Anon 2226803 Not if you know how the AI works. I've forgotten that, though.
>> [_] Anon 2226814 impossible
>> [_] Anon 2226815 >># beat it
>> [_] Anon 2226823 take two off the top row then three off the bottom row go from there
>> [_] Anon 2226827 http://home.comcast.net/~markjoel/pearls /solution.htm
>> [_] Anon 2226829 you can only win when he lets you win
>> [_] Anon 2226850 So slow to restart the game.

File[pearls.swf] - (150 KB)
[_] [G] So you want to play a game, huh? Anon 1431833 Marked for deletion (old).
>> [_] Anon 1431851 a variant of the game nimh, only in this the rules are wrong, the number of stones is wrong and since you always go first you are at a major disadvantage
>> [_] Anon 1431856 Since you always go first, you can't win.
>> [_] Anon 1431860 The only winning move is not to play.
>> [_] Anon 1431865 oh you can win, the trick in this game is to always make sure you round your opponent's choice up to an even number, if they take one so do you, if they take two, so do you and so on, however since you go first you have to try to plan your penultimate move to make sure the opponent can only round up to an odd number, it's not easy though.
>> [_] Anon 1431870 There's a pattern preset into the game that forces the computer to make a bad move. The maker hardcoded it in for some reason, but otherwise it is unwinnable(and the pattern should be unwinnable too... but it makes a mistake on purpose)
>> [_] Anon 1431873 1.)take 2 from the top row 2.)guy takes 1 from middle row 3.)take 3 from bottom row 4.)guy takes 1 from the middle row again 5.)take the last pearl from the top row 6.)guy takes one pearl again 7.)clear out the row he didn't take a pearl from in step 6 8.)??? 9.)PROFIT
>> [_] Anon 1431948 >># That only works if you're playing the correct way. This one if different
>> [_] Anon 1431967 >># It does not make the mistake on purpose. If the person going first makes the correct move and knows what they're doing there's absolutely nothing the person who goes second can do to win. However, there's only one move the first player can do otherwise the second player will win no matter what. Excluding not knowing what to do in this game.
>> [_] Anon 1431974 You people are such morons it's not even funny. First of all, you get to decide who goes first. This should already tell you you can win.
>> [_] Anon 1431982 >># You must be playing the other ones, this one always makes player go 1st, only one solution to this and il give a hint, you start with... oh wait, someone already posted it all... >># You do realize that no one will do this for themselves now right?
>> [_] Red 1432102 >># This works.
>> [_] Anon 1432103 >># /game
>> [_] K !Cirnov8N9. 1432132 >># /game Also I love the RAGEQUIT

File[pearls.swf] - (150 KB)
[_] [G] Anon 1396812 Marked for deletion (old).
>> [_] Anon 1396847 unwinable.
>> [_] Anon 1396879 http://www.karipearls.com/beat-pearls-be fore-swine.html
>> [_] Anon 1396940 on premise i dont play anything with an "intro." ps: shit sucks
>> [_] Anon 1396943 >># you dont play video games then?
>> [_] Anon 1397091 How to win: Take the # of pearls on each row and turn it into a 3 place binary number: 3 = 011, 4 = 100, 5 = 101 You want each column to equal an even number when your turn is over, so remove 2 pearls from the top row 1 = 001, 4 = 100, 5 = 101 001 100 101 = 202 This works with each version of the game.

File[pearls.swf] - (150 KB)
[_] [G] Anon 1373030 So you wanna play a game, huh? Marked for deletion (old).
>> [_] Anon 1373032 Interesting game. The only way to win is not to play.
>> [_] Anon 1373034 >># No, you can win. It just takes a few tries.
>> [_] OP 1373035 >># no; google "Pearls Before Swine game". ideally there is no way for you to win, but the designers built a flaw into it.
>> [_] Real OP 1373040 you just want the answers?
>> [_] Anon 1373063 Found the winning strategy: 1. Take 2 from A (top row of 2). 2. Pirate takes 1 from B (second row of 4). 3. Take 3 from C (botton row of 5). 4. Pirate takes 1 from B. 5. Take remaining pearl from A. 6. Pirate takes 1 from B. 7. Take remaining 2 from C. 8. This leaves one in B & you win. Frankly, I don't know why they would make an unwinnable game, & then program a victory strategy into the game, but whatever, it's a nice thing to do.
>> [_] Anon 1373065 >># this is a great way to scam money off of people, lol