A criminal is planning an escape across a well-guarded bridge, which has a series of 9 guards, who each require a bribe of one coin in order to pass by them in either direction.
The criminal can keep a stash of coins in the area before the guards and between each guard. However, he can only carry 4 coins when approaching or passing any guard, in order to remain stealthy and not alert the other guards.
For example, if he starts with 6 coins, he can bring 4 with him to bribe the first guard, and end up with 3 coins in between the first and second guards.
How many coins does the criminal need to bring to the bridge in order to successfully pass by all 9 guards?
Continue reading “Bribing a Series of Guards”

