none
SUPER CHALLENGE for APRIL - only for E X P E R T !!!!!!! RRS feed

  • 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_ref-1">[1]</sup> Variations of the knight's tour problem involve chessboards of different sizes than the usual 8 × 8, as well as irregular (non-rectangular) boards.

    see wikipedia:

    https://en.wikipedia.org/wiki/Knight%27s_tour

    Sunday, March 27, 2016 7:41 PM
    Answerer

Answers

  • This is my second step for the knight's tour: WPV159-0.

    This program can get the first solution for 5x5 board in about 4 minutes.  But too slow to get a solution for 8x8 board...

    Screen shot of a program Knight's Tour 0.4


    Nonki Takahashi

    Friday, April 15, 2016 3:13 PM
    Moderator

All replies

  • This is my first step for the knight's tour: WPV159.

    You can move a knight with mouse click.

    Screen shot of a program Knight's Tour 0.3


    Nonki Takahashi

    Friday, April 1, 2016 3:14 PM
    Moderator
  • I knew Nonki that you could do this puzzle, because if I look at all of your programs that you showed us in the past, I am very impressed with your programming skills.!

    GO-GO-GO !!!!!!!!!!

    Friday, April 1, 2016 4:30 PM
    Answerer
  • This is my second step for the knight's tour: WPV159-0.

    This program can get the first solution for 5x5 board in about 4 minutes.  But too slow to get a solution for 8x8 board...

    Screen shot of a program Knight's Tour 0.4


    Nonki Takahashi

    Friday, April 15, 2016 3:13 PM
    Moderator
  • This is my third step for the knight's tour: WPV159-3.

    This program needs only 0.55 sec to get the first solution for 8x8 board!  I adopted a heuristic Warnsdorff-rule algorithm.

    Screen shot of a program Knight's Tour 0.6


    Nonki Takahashi

    Saturday, April 16, 2016 2:02 AM
    Moderator
  • Hi Nonki

    your program WPV159-3. is very impressive !!!

    as myself a chessplayer, i like it so much ,i will keep it for ever !!

    BEAUTIFUL DESIGN ! :)

    Saturday, April 16, 2016 9:33 PM
    Answerer