JAVA CODE: TipsyKnight Tour IT IS ESENTIAL TO INCLUDE JAVADOC COMMENTS!!! There
ID: 3771320 • Letter: J
Question
JAVA CODE: TipsyKnight Tour IT IS ESENTIAL TO INCLUDE JAVADOC COMMENTS!!! There are many classic examples of knights tour in JAVA. A tipsy/drunk knights tour uses a similar algorithm to try to visit every space from a 8X8 grid. What makes him tipsy is the process of using random to achieve the task. The aim is a sequence of 63 consecutive legal knight moves which the knight visits each of the board spaces on an 8 by 8 grid exactly once. Please use THIS method NOT backtracking or any other algorithm to write a java code for the tipsy knight.. Use a random starting square from the board to make a sequence of the knights moves. Do this by selecting the knights next move randomly from the list of available/legal moves from the current square to a square not yet visited!! The tour ends when there are no more moves legally available from the current position of knight. Once the algorithm is working we must do its several times and display the best tour. A tour is better than the other if it makes it to more squares(ex: a tour that lasts 40 moves is better than one that lasts 5]. We must display the best tour of several hundred runs. Displaying a tour means output a 8*8 table or grid which shows the tour using consecutive integers(1,2,3,4,5...) which represents the sequence of the tour. Display the first five tours that are generated by this method. We want to keep a record of the longest tour created and display a tour only if it longer than the current longest tour so far. The best tour means the one that gets closest to getting to every single square on the board. The program can generate 1000+tours and display a result after every 100 tours to make sure the program is still functioning IT IS ESENTIAL TO INCLUDE JAVADOC COMMENTS!!! Thank you in advance!!Explanation / Answer
output:
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.