# The Battle of Puzzlings

I present to you...

# The Battle of Puzzlings

Your task is to turn 'one' into a letter representation of 1066 (the year of the Battle of Hastings):

## Rules

• Fewest moves wins.
• All matches must be used.
• You cannot 'snap' matches to make multiple matches.

You can use these background and matchstick images in your answer if you're into that sort of thing.

• Is there a limit on the number of matches we can move? Commented Aug 9, 2017 at 19:42
• @benzene Nope... Commented Aug 9, 2017 at 19:44
• I suggest that you make it a competition to see who can find the minimum amount of moves, otherwise this is too broad Commented Aug 9, 2017 at 19:51
• 0 moves - the "one" actually says "DNE" - the answer does not exist. Commented Aug 28, 2017 at 4:08

One possible solution is

Use Roman numerals: 10 VI VI

You have 4+3+4 = 11 matches. Use 1 for the 1, 4 for the 0 and 3 for each V1, for a total of 11.

And if we're counting moves:

Four moves are needed. Move the left bar of the N to the left of the O to make the 1, then move all three arms of the E to form the second VI, leaving the back of the E as the I in the first VI.

• Question edited after your answer but bravo anyway! Commented Aug 9, 2017 at 20:28

I made in 4 moves:

Using A1Z26 to represent 1066 as JFF (10, 6, 6)

• Clever! Didn't think of doing it that way Commented Aug 11, 2017 at 11:24

The minimum number of moves is

6 with a slanted letter or 7 without

1066 is

MLXVI in roman numerals.

1066 has 11 matches - and so does that so:

Taking either 6 or 7 moves.

This is the minimum because

'ONE' only shares 5 matchsticks in common with 'MLXVI'(slanted V version) - meaning that the other 6 have to be moved. Therefore 6 is the minimum. Here is a diagram:

You can see there are only 5 matchsticks (black) that are shared - and the other 6 green matchsticks have to be moved to red.

PREVIOUS - Thanks HughMeyer for suggesting moving the overlay to the left for less moves

I previously thought it was 8:

• This is the answer I was aiming for, but the question needs to be improved. Suggestions appreciated. Commented Aug 9, 2017 at 20:06
• @rybo111 I thought it might be from the number of matches. As to how it could be improved - to not make it so broad maybe say it has to be made out of letters? Not sure. There needs to be a 'challenge' of some sort Commented Aug 9, 2017 at 20:09
• I've taken both your suggestions on board ('letter representation' and 'fewest moves'). Let's see if you can be beaten! Commented Aug 9, 2017 at 20:23
• @rybo111 I know a way to check if this is the minimum - so will see Commented Aug 9, 2017 at 20:27
• @rybo111 proven this is the minimum. see edit Commented Aug 9, 2017 at 20:34

A (perhaps cheap) solution in 2 moves:

Use Hexadecimal. 1066 in Hex is 0x42A. Then, move the matches like so:

If you rotate your point of view, you'll find the characters 4, 2, and A stacked one on top of the other:

Admittedly, the 2 looks more like a Z, but is still somewhat believable.

• I don't believe it's right, but it's clever and unorthodox. I like it. Commented Aug 15, 2017 at 18:11