Example from PGP IB; remove two matches to make a valid equation. (Solution: remove G and J to get "6-5=1")

A certain arrangement of matches is given. In the diagram, move/remove a given number of matches so that it fulfils the given objectives (i.e. turn it into the biggest number possible, turn it into a valid equation, etc.).

History of the puzzleEdit

This type is pretty old. A puzzle involving matchsticks appears in Sam Loyd's Cyclopedia of Puzzles, published in 1914.[1]

Appearances in the past WPCsEdit