All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info
Home > Games
These are problems relating to various games and strategies for playing them.
Difficulty: 3 of 5 Latest: Solo Mancala
In Mancala, a player has a row of pits containing 0 or more seeds. At the end of the row is a section called the store. On a player's turn, they take all the seeds from a pit and sow them to the right, one seed per pit or store, until they have placed them all. If the last seed goes in the store, they go again.

Ordinarily, Mancala is a two-player game where each has a store. For this puzzle, there is no opponent so the seeds cannot go past the store. As a consequence, pit A can never have more than 1 seed, pit B can never have more than 2 seeds, etc.

The question is for a given number of pits, n, what's the maximum number of seeds, S(n) that a player can start and with optimum play drop the last seed in the store with each move?

For example S(2)=3. In the diagram, B and A are the pits, and X is the store:

BAX
210
201
012
003

Derive a formula for S(n).

If a reasonable formula is not possible, try to give an approximation for large n.

(No Solution Yet, 0 Comments) Submitted on 2024-05-31 by Jer   
Page 2 of 12   << prev next >>    
Difficulty: 3 of 5A nim variation | Rating: 5.00
Posted on 2021-12-09 by Jer (No Solution Yet, 5 Comments)
Difficulty: 3 of 5Bishops galore | Rating: 4.00
Posted on 2021-09-01 by Ady TZIDON (No Solution Yet, 6 Comments)
Difficulty: 2 of 5Can you do it? |
Posted on 2020-06-08 by Ady TZIDON (No Solution Yet, 4 Comments)
Difficulty: 3 of 5Euler and the Modern Army | Rating: 5.00
Posted on 2020-05-22 by broll (No Solution Yet, 10 Comments)
Difficulty: 3 of 5Two players, three pots | Rating: 3.00
Posted on 2020-01-03 by Brian Smith (Solution Posted, 5 Comments)
Difficulty: 3 of 5Grid nim: 2xN | Rating: 4.50
Posted on 2019-01-16 by Jer (No Solution Yet, 8 Comments)
Difficulty: 3 of 5Sudoku 1 (starting clues) | Rating: 1.00
Posted on 2018-11-30 by Ady TZIDON (No Solution Yet, 7 Comments)
Difficulty: 3 of 5Duelling pairs |
Posted on 2018-11-02 by Ady TZIDON (No Solution Yet, 16 Comments)
Difficulty: 3 of 5White to move |
Posted on 2018-07-20 by Ady TZIDON (No Solution Yet, 6 Comments)
Difficulty: 3 of 5Do not say ONE |
Posted on 2017-12-23 by Ady TZIDON (Solution Posted, 3 Comments)
Difficulty: 3 of 5Dice stacking |
Posted on 2017-11-28 by TheKPAXian (No Solution Yet, 4 Comments)
Difficulty: 4 of 5More Than One Solution? | Rating: 3.00
Posted on 2017-10-26 by Charlie (No Solution Yet, 3 Comments)
Difficulty: 4 of 531 or more |
Posted on 2017-10-21 by Ady TZIDON (No Solution Yet, 6 Comments)
Difficulty: 3 of 5Many Knights |
Posted on 2017-07-05 by Brian Smith (No Solution Yet, 2 Comments)
Difficulty: 4 of 52 kids 3 boxes | Rating: 4.00
Posted on 2017-07-01 by Ady TZIDON (No Solution Yet, 1 Comments)
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (2)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (12)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information