Connection ErrorBad RequestThis page went staleSession ExpiredSign in requiredForbiddenNot FoundToo Many RequestsServer ErrorBad GatewayService UnavailableGateway TimeoutHTTP Version Not Supported
Session Expired
Your session has expired. Please log in to continue.
Sign in required
You need an account to do that. Sign in or create one — it only takes a minute.
This page went stale
Your security token was rejected, usually because the page sat open too long or you signed in elsewhere. Nothing was saved. Reload the page and try again.
Request Failed
We encountered an issue while processing your request.
Please check your internet connection and try again.
I was told that I am setting a puzzle. Okay.
It's a fairly standard puzzle: you need to swap the numbers 4 and 5. Obviously, the numbers can only be moved to an empty cell, and the cell where the number was before becomes empty.
But I don't need the solution to this problem. I am interested in the minimum number of moves required to solve this puzzle. A proof is desirable, but I think I won't require it (unless those who answer start solving the puzzle by brute force, then a proof will be needed).