## A Problem in Checker-Jumping II

### Getting a Scout out of Desert

Reversing the moves in a checker jumping problem was an approach preferred by Leibniz to solving the game of solitaire. The applet below follows the same idea for the puzzle of Sending Scouts into the Desert. (I am grateful to an anonymous visitor for suggesting that, for this puzzle, the move reversal may also help solve the problem.)

The task here is to get a scout (or scouts) out of the desert and into an inhabitable area. As in the original puzzle, the two areas are separated by a horizontal line, with the desert being the top one. To move a scout (a red chip), click on it and then click on the intended new location. This is only possible if the new location is empty (blank), is 2 units away from the scout either horizontally or vertically, and if the intermediate location is empty. As the result of these actions, the scout will move to the new location and another will pop up (by magic, no doubt) at the location jumped over.

The goal now is to leave the desert void of the scouts.

What if applet does not run? |

### Fibonacci Numbers

- Ceva's Theorem: A Matter of Appreciation
- When the Counting Gets Tough, the Tough Count on Mathematics
- I. Sharygin's Problem of Criminal Ministers
- Single Pile Games
- Take-Away Games
- Number 8 Is Interesting
- Curry's Paradox
- A Problem in Checker-Jumping
- Getting a Scout out of Desert

- Fibonacci's Quickies
- Fibonacci Numbers in Equilateral Triangle
- Binet's Formula by Inducion
- Binet's Formula via Generating Functions
- Generating Functions from Recurrences
- Cassini's Identity
- Fibonacci Idendtities with Matrices
- GCD of Fibonacci Numbers
- Binet's Formula with Cosines
- Lame's Theorem - First Application of Fibonacci Numbers

|Contact| |Front page| |Contents| |Games| |Impossible| |Activities|

Copyright © 1996-2018 Alexander Bogomolny

71408840