Simple Strategy for Pearls before Swine | Transcience.com.au

  • Thread starter Thread starter BicycleTree
  • Start date Start date
Click For Summary

Discussion Overview

The discussion revolves around strategies for the game "Pearls before Swine," which is likened to the game of Nim. Participants explore potential strategies for winning, particularly focusing on scenarios with different numbers of piles and the implications of those configurations on gameplay.

Discussion Character

  • Exploratory
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • Some participants suggest that there is a simple strategy for the game, similar to Nim, particularly when there are two piles.
  • One participant proposes that in a three-pile scenario, the goal should be to avoid ending up with two equal-sized rows, aiming instead to force the opponent to deplete one row while the others differ in size.
  • Another participant challenges the simplicity of the proposed strategies, noting that Nim has a straightforward winning method regardless of the number of rows, and expresses frustration with the inefficiency of their computational approach to finding the right move.
  • A participant confirms the existence of a simple strategy akin to Nim and shares personal progress in the game, indicating that it is a challenging puzzle.
  • One participant suggests a tactic of playing two games simultaneously to gain an advantage, although they acknowledge this does not apply to the third version of the game.
  • Another participant asserts that the Nim strategy can be adapted for the game, with modifications needed only at the endgame stage.

Areas of Agreement / Disagreement

Participants express differing views on the simplicity and effectiveness of strategies for the game. While some believe in the existence of a straightforward strategy, others argue that the complexity increases with more piles, leading to unresolved questions about optimal approaches.

Contextual Notes

Some participants mention computational challenges and inefficiencies in their strategies, indicating that the mathematical underpinnings of the game may not be fully resolved. There is also uncertainty regarding the applicability of strategies across different versions of the game.

BicycleTree
Messages
519
Reaction score
0
Physics news on Phys.org
there is a strategy. if there are 2 piles (rows whatever) then if you go first you must take out of the larger pile to make them the same size. then whatever you opponent does, just copy him. that way you win. I am not sure about 3 piles, but i imagine its similar.
 
in three piles i haven't come up with a strategy yet but the idea i think is to make sure you don't end up with two rows with equal size... in fact you want him to end the third row while the other two have different sizes.
 
That's not a simple strategy. For Nim there is a simple way to win no matter how many rows there are. There must be some way to speed the computation because I just wrote a Java program to find the right move and although it works, it's taking forever on this problem (rows with 5, 7, and 11). Whereas Juan in the game can move very quickly. Of course my algorithm is very inefficient and recursive, needlessly re-calculating positions many (probably millions, in this case) of times.
 
Last edited:
Confim: There Is a simple strategy and it's a lot like the strategy for Nim. I just got to level 11, 10-2 my favor since I made a couple mistakes at the beginning. Now this is a real brain teaser. (fair to use Google to find the strategy for normal nim)

Further brain teaser (that I haven't solved): How do you prove that the strategy works?
 
You can beat it really easy... just open 2 games up... have one start first, then after he has started, you follow behind doing the exact same thing on the other one... and at the end, you will win... Oh, wait... that don't work for the 3ed version... anyway... on 1 and 2 it does... oh, too bad...
 
Last edited:
The strategy for Nim where you have win if you take the last pearl is very similar.
In fact, you can use the exact same strategy and only change your moves at the end when you can clearly see what the right move is. I got me to level 23, then made a stupid mistake by trying to take back a move by rewinding the flash applet. Then it crashed.
 
Yup! That's the strategy.
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
4
Views
1K
  • · Replies 9 ·
Replies
9
Views
5K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 17 ·
Replies
17
Views
9K
Replies
1
Views
4K
  • · Replies 2 ·
Replies
2
Views
5K