1
$\begingroup$

This quiz is about the 8-puzzle. It is a board with 9 fields. There are 8 tiles with numbers from one to eight. One field is empty. You can slide numbers around the board: But only numbers next to the empty field can be slid into the empty field:

1  2  3
4     5
6  7  8

You can slide the 2, 4, 7 and 5 into the middle.

The start position is this:

1  2  3
4  5  6
7  8

Your task is to give me the algorithm needed to get my puzzle back to the start position.

My puzzle is:

2  8  3
1  5  6
4  7

Hint:

I needed eleven boards to create this pattern, including start and end state.

First solution wins.

$\endgroup$
3
  • $\begingroup$ More information: en.wikipedia.org/wiki/15_puzzle $\endgroup$ Commented Jul 10, 2017 at 8:49
  • $\begingroup$ So it doesn't have to be the shortest? Also how could you tell if we used computers or not. $\endgroup$
    – somebody
    Commented Jul 10, 2017 at 9:01
  • $\begingroup$ He can't. He simply believes in our honesty. $\endgroup$ Commented Jul 10, 2017 at 9:06

2 Answers 2

4
$\begingroup$

This is kinda easy to solve in my opinion (10 moves):

enter image description here

$\endgroup$
2
  • $\begingroup$ Rather 10 moves, no ? $\endgroup$ Commented Jul 10, 2017 at 9:04
  • $\begingroup$ @JonMarkPerry fixed it. $\endgroup$
    – Oray
    Commented Jul 10, 2017 at 9:06
2
$\begingroup$

Here is my answer:

6-5-8-2-1-4-7-8-5-6

$\endgroup$
1
  • $\begingroup$ Please hide your answer, as I have done for you. $\endgroup$ Commented Jul 11, 2017 at 7:21

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.