From WPC unofficial wiki
Jump to navigation Jump to search


Coins Example.png Coins Example Solution.png

Place one coin into each cell such that the sum of the coins in each row (and column) matches the number to the left (and the top). The valid denominations of coins are supplied with the puzzle; the same denomination may be used multiple times in each row (or column).

(Rules and example from PGP IB)

Rule variations[edit]

  • In most puzzles, the coin denominations used are {1, 2, 5, 10, 20, 50}, which heavily reflects the puzzle's European origin. However, there is no need for the denominations to be this value.

History of the puzzle[edit]

Appeared on WPC 2005/Part 5, "Hungarian style" round. Author of the puzzle was Sándor Elekes (Hungary). However, it is possible that the puzzle predates this.

Appearances in the past WPCs[edit]