All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
Maximizing Matches Model (Posted on 2014-01-22) Difficulty: 3 of 5
A five digit number 82093, constructed by 29 matches looks like this:

  _    _    _    _    _ 
 |_|   _|  | |  |_|   _|
 |_|  |_   |_|   _|   _|

You are requested to make this number as big as possible by moving only two matches.

What is the maximum value and how is it achieved?

What would be your answer if 3 matches were allowed to be relocated?

Be creative - no restrictions re your answers.

See The Solution Submitted by Ady TZIDON    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Some Thoughts My conventional tries | Comment 4 of 16 |

The simplest 2-match transfer that comes to mind with a large payoff is taking the two leftmost matches from the leading 8 and using them to form a 1 to the right of the previously terminal 3, making 320,931.

For a 3-match move, just take just the bottom left vertical from the 8 and the bottom horizontal from the 9 to form the 1 on the right, and use the top horizontal from the 9 to turn the 2 into a 6, making 960,431.

If you were willing to accept a single vertical match to be a 1, then just take the bottom left vertical from the 8 to use alone as a 1 at the end, and shift the bottom left match from the 2 to the right side to make a 3. Then you'd have 930931 with just two matches moved.

  Posted by Charlie on 2014-01-22 16:00:00
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information