
What is the biggest number you can make by moving exactly 2 matches in the number above?
Assume that numbers must be represented in their standard “digital clock” font (for example, a “1” requires two segments).
Continue reading “Match Maximization”Puzzles that involve moving matchsticks to form certain shapes, numbers, or letters

What is the biggest number you can make by moving exactly 2 matches in the number above?
Assume that numbers must be represented in their standard “digital clock” font (for example, a “1” requires two segments).
Continue reading “Match Maximization”