European Peg Solitaire Solvability

Source: Wikipedia article on Peg Solitaire

Problem:


The European version of the popular game "Brainvita" (or "Peg Solitaire") looks as follows:

Y Y O O O Y Y
Y O O O O O Y
O O O O O O O
O O O T O O O
O O O O O O O
Y O O O O O Y
Y Y O O O Y Y

Prove that the initial configuration as shown in the representation is not solvable.

Background:
The game fills the entire board with pegs except for the central hole. The objective is, making valid moves, to empty the entire board except for a solitary peg. A valid move is to jump a peg orthogonally over an adjacent peg into a hole two positions away and then to remove the jumped peg.

Similar Problems:
Rubik's Cube
Sam Loyd Puzzle Solvability

Update:
Solution posted by Pritish Kamath (CSE IITB 2012 Alumnus, Assistant Researcher MSR Bangalore) in comments!

Comments

  1. Pritish12:22 AM, November 20, 2012

    If you cover your board with three colours in the following manner :

    ..abc..
    .abcab.
    abcabca
    bcabcab
    cabcabc
    .bcabc.
    ..abc..

    Let A, B and C be the number of pebbles on colours 'a', 'b' and 'c' respectively. The relative parity of A, B and C remains conserved after every move. And initially, A = B = C = 12. Hence it is unsolvable.

    PS : By relative parity, I mean [A (xor) B] and [B (xor) C] are conserved.
    Basically, if initially, A:odd B:odd C:even, then after any number of moves, it'll either be A:odd B:odd C:even or A:even B:even C:odd

    ReplyDelete
    Replies
    1. Prince6:50 AM, June 26, 2014

      What is logic behind conservation of relative parity?

      Delete
  2. Crazy Dino4:17 PM, November 24, 2012

    Just colour it like a chess board. Then we will have 16 pegs in black and 20 pegs in white (or vice versa). A valid move always gets a peg into the same colour and a peg is removed from the same colour. So, definitely one peg from each of the colour will remain no matter what.

    ReplyDelete
  3. Pratik Poddar3:33 AM, December 18, 2012

    @Pritish, Thanks for the correct solution.
    @Crazy Dino, Your solution is not correct.

    ReplyDelete

Post a Comment

Popular posts from this blog

Buying Dimsums

Source: Alok Goyal (Stellaris VP, Ex-Helion VC) puzzle blog Problem: A fast food restaurant sells dimsums in boxes of 7 and 3. What’s the greatest number of dimsums a person cannot buy. Generalize it for p and q where p and q are relatively prime. I loved the puzzle. Hope you enjoy it too.
Read more

Fraction Brainteaser

Source: Sent to me by Gaurav Sinha Problem: Siddhant writes a Maths test and correctly answers 5 out of 6 Arithmetic questions and 20 out of 28 Geometry questions.  In total, Siddhant scores 25 out of 34.  Vaibhav writes another Maths test and correctly answers 20 out of 25 Arithmetic questions and 6 out of 9 Geometry questions. in total, Vaibhav scores 26 out of 34. Note that a) Vaibhav scores more than Siddhant b) Siddhant score better than Vaibhav in both individual topics -  5/6 > 20/25 and 20/28 > 6/9 How is it possible? 
Read more

Consecutive Heads

Let's say A keep tossing a fair coin, until he get 2 consecutive heads, define X to be the number of tosses for this process; B keep tossing another fair coin, until he get 3 consecutive heads, define Y to be the number of the tosses for this process. 1) Calculate P{X>Y} 2) What's the expected value of X 3) What's the expected value of Y This is probably the hardest puzzle I have ever put on my blog. Hence, I will post its solution in the post directly rather than on comment. Solution: 1) (Solved by me finally after 13 months :)) Make a state diagram. Let the state be (a,b) where a is the number of consecutive heads streak "A" is on currently and b is the number of consecutive heads streak "B" is on currently. So, (0,3) (1,3) are final accepted states and (2,0) (2,1) (2,2) (2,3) are failure states. If you get tails, your contribution to the state reaches to "0" f(State) = P(X>Y | "State" configuration initially) ...
Read more