Skip to content
Get started

Soldiers jumping over a line

HardBrainteasers10 min

An infinite board of squares has a horizontal line; you may place as many soldiers (pegs) as you like on squares below the line, at most one per square. A move is a peg-solitaire jump: a soldier jumps horizontally or vertically over an adjacent soldier into an empty square directly beyond, and the jumped soldier is removed. Rows above the line are numbered 1,2,3,…1, 2, 3, \dots. Using finitely many soldiers, what is the highest row a soldier can reach?

Show hints (3)+
  1. Try to find a weighting of the squares that no jump can increase.
  2. Use weights σd\sigma^d with dd the distance to the target and σ2+σ=1\sigma^2 + \sigma = 1.
  3. Sum the weights over the whole half-plane for a target in row 5.

Answer

Reveal answer →

4

Create a free account to see the full worked solution and track your progress.

Interview format: Hedge Fund Quant, Trading Aptitude Tests

Related questions