Knight , Chess , Move
Hi .
I need to write a program to find a way for khingt to start from (0,0) and go to all of the chess cells , while it shouldn't pass any cell [square] twice . The program most write(cout) all the moves . Can anyone help me ?
I need to write a program to find a way for khingt to start from (0,0) and go to all of the chess cells , while it shouldn't pass any cell [square] twice . The program most write(cout) all the moves . Can anyone help me ?
Last edited on
Topic archived. No new replies allowed.