Answered by:
SUPER CHALLENGE for APRIL  only for E X P E R T !!!!!!!
Question

CAN YOU DO THIS VERY CHALLENGING PROBLEM IN SMALL BASIC !!
( me, no i can't to hard for me :) )
it is my suggestion for an April challenge of the month.
here is the challenge:
A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square only once. If the knight ends on a square that is one knight's move from the beginning square (so that it could tour the board again immediately, following the same path), the tour is closed, otherwise it is open.
The knight's tour problem is the mathematical problem of finding a knight's tour. Creating a program to find a knight's tour is a common problem given to computer science students.<sup class="reference" id="cite_ref1">[1]</sup> Variations of the knight's tour problem involve chessboards of different sizes than the usual 8 × 8, as well as irregular (nonrectangular) boards.
see wikipedia:
https://en.wikipedia.org/wiki/Knight%27s_tour
Answers

This is my second step for the knight's tour: WPV1590.
This program can get the first solution for 5x5 board in about 4 minutes. But too slow to get a solution for 8x8 board...
Nonki Takahashi
 Proposed as answer by litdevModerator Friday, April 15, 2016 5:38 PM
 Marked as answer by litdevModerator Tuesday, April 19, 2016 9:50 PM
All replies



This is my second step for the knight's tour: WPV1590.
This program can get the first solution for 5x5 board in about 4 minutes. But too slow to get a solution for 8x8 board...
Nonki Takahashi
 Proposed as answer by litdevModerator Friday, April 15, 2016 5:38 PM
 Marked as answer by litdevModerator Tuesday, April 19, 2016 9:50 PM

