-1
$\begingroup$

I need to know what is the minimum number of moves a chess piece has to do from an X position to pass through all squares of a board. Mathmatic and programming solutions are welcome. I need because I am working on an essay about chess. EDIT: THE BOARD ONLY CONTAINS THE PIECE TO BE TESTED.

$\endgroup$
2
  • 2
    $\begingroup$ Could you specify the allowed moves in this question? Also, we would like to see what attempt you have done to tackle this question. $\endgroup$
    – user808951
    Sep 15, 2020 at 15:41
  • $\begingroup$ For the knight, knight moves; for the queen, queen moves, and so on. In this case let's suppose Knight starts as white in house b1, so I want to know how many moves he can make from take house in such way he passes through all positions in the minimal number of moves. By the way, I am noob at mathmatics. Sorry. I tried manually doing that but it doesn't seem a good idea. $\endgroup$
    – XianLiu
    Sep 15, 2020 at 17:58

1 Answer 1

-1
$\begingroup$

Please try not to post PSQs on Math SE

Hint

enter image description here

$\endgroup$
3
  • $\begingroup$ For the queen, king and tower there is a better approach. $\endgroup$
    – XianLiu
    Sep 15, 2020 at 17:59
  • $\begingroup$ I think you cannot complete it in fewer than 5 moves $\endgroup$ Sep 15, 2020 at 18:24
  • $\begingroup$ I made an edit: The board has only the piece to be tested. $\endgroup$
    – XianLiu
    Sep 15, 2020 at 18:34

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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