# Match Maximization

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).

#### Solution

81151 is the biggest number.

The trick is you are not limited to just 3 digits! Break the “0” into two ones, and use those two matches to create a new “1” before the 5 (which gives you 15118). Then turn your head and view the whole thing upside-down:

(If you consider changing your perspective an unfair gimmick, 51181 would be the biggest number you could make.)

Enjoy matchstick puzzles?
Get a whole book of them

Disclosure: The post contains affiliate links, through which I may earn a small fee if you make a purchase, at no additional cost to you. As an Amazon Associate I earn from qualifying purchases.

980

• #### 5061

is this not doable?

999

47

1509

15118

81151

1503

999

• #### John

980 …..I can’t see how some of these people end up with 1500 1200 by sonly moving two matches

👍

985

51181

5118^11

1900

15118

999

9E8

985

980

990

990

5031

999

21. #### PJ

U r not exactly moving 2 matchsticks u r moving 4??

22. #### Chet Walker

The answer is NOT 81151. Turning it upside down is moving ALL the matchsticks. The non-trick answer is 51181.

• #### BrainEaser

The idea is you turn your head around and view it from a different angle, rather than moving any matchsticks. But your perspective (that this is a gimmick or a trick) is equally valid.

23. #### Bruce

my answer is 51181 , there has to be two matches to create the number one!!

24. #### Chris

The highest number I can see is 151,181. There is no rule in the directions that says a number 1 has to be two matches in length.

• #### BrainEaser

The directions do state that a “1” requires two segments.

990

1505