We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
- Prepare
- Algorithms
- Recursion
- Bowling Pins
- Discussions
Bowling Pins
Bowling Pins
Sort by
recency
|
20 Discussions
|
Please Login in order to post a comment
I can't understand what "optimally" means.
IIXXIIIIII if my turn is first how can i win if i and my friend knockdown all two pins which are adjacent to each other
II - my turn XX -skipped II - his turn II - myturn II -his turn
Here is Bowling Pins problem solution in Python Java C++ and c programming - https://programs.programmingoneonone.com/2021/07/hackerrank-bowling-pins-problem-solution.html
Took a look at your python solution:
While it is fine and fast, it doesn't use recursion.
(I guess, all this problems in the 'Recursion' category are meant as an exercise how to make proficient use of recursion.)
Here is some recursive solution in python:
Hello! I've left my Java 8 solution here in case anyone has trouble.
Just keep in mind: - GrundyNumbers. - Minimum Excludant. - GrundyNumber of multiple games is the XOR of the grundy numbers of the games. - You only have to evaluate a state once.
Hey, I'm trying to solve this problem. I studied the combinational game theory but I find something confusing. If i have three pins.
III
mex{1,2} = 0 means LOSE. But I can knock down the middle pin and it will beIXI
for the next player he/she can only knock either the left or right so I will it will be a WIN. Am I implementing the game theory wrong or...?III mex{0,1,2} = 3 means Win. Since mex of grundy numbers of all sub games. IXX = 1, IIX =2, IXI =0. You missed the grundy number of state IXI.