Program Explanation Program: //Import required packages import java.util.ArrayList; import javafx.animation.KeyFrame; import javafx.animation.Timeline; import javafx.application.Application; import javafx.geometry.Point2D; import javafx.geometry.Pos; import javafx.scene.Scene; import javafx.scene.control.Button; import javafx.scene.image.ImageView; import javafx.scene.layout.BorderPane; import javafx.scene.layout.Pane; import javafx.scene.shape.Line; import javafx.stage.Stage; import javafx.util.Duration; //Main class public class E33 extends Application { //Declare required variables private static final int SIZE = 8; private int startX = 0; private int startY = 0; private ArrayList<Point2D> moveHistory = null; //Override start method @Override //Start method public void start(Stage primaryStage) { //Create a border pane BorderPane pane = new BorderPane(); //Create a pane for chessboard ChessBoard board = new ChessBoard(); //Set the board to center pane.setCenter(board); //Create a button Button btSolve = new Button("Solve"); //Set the button at the bottom pane.setBottom(btSolve); //Set the border pane at the center BorderPane.setAlignment(btSolve, Pos.CENTER); //Create a scene Scene scene = new Scene(pane, 250, 250); //Set the title primaryStage.setTitle("Exercise18_32"); //Place the scene on the stage primaryStage.setScene(scene); //Display the stage primaryStage.show(); //Call the function board.paint(); //Set the action for the button btSolve.setOnAction(e -> { //Create an array boolean[][] moves = new boolean[SIZE][SIZE]; //Set the cell as true moves[startX][startY] = true; //Call the function resetMoveHistory(); //Call the function addMoveHistory(startX, startY); //Call the function solvePuzzle(moves, 1, startX, startY); //Call the function board.startAnimation(); }); //Set the width property scene.widthProperty().addListener(ov -> int()); //Set the height property scene.heightProperty().addListener(ov -> board.paint()); } //Function definition private boolean solvePuzzle(boolean[][] moves, int numMoves, int x, int y) { //Declare required variables int nextX = 0; int nextY = 0; int bestMoveX = 0; int bestMoveY = 0; int bestMoveX2 = 0; int bestMoveY2 = 0; int minMoveCount = SIZE; int moveCount = 0; //Loop from 2 to -2 for (int i = 2; i >= -2; i += -4) { //Loop from 1 to -1 for (int j = 1; j >= -1; j += -2) { //Update the values nextX = x + i; nextY = y + j; //Check the condition if (nextX >= 0 && nextX <= SIZE - 1 && nextY >= 0 && nextY <= SIZE - 1 && !moves[nextX][nextY]) { //Call the function moveCount = lookAheadCount(moves, nextX, nextY); /*Check if the value is less than or equal to minMoveCount*/ if (moveCount <= minMoveCount) { /*Assign the value moveCount of to minMoveCount*/ minMoveCount = moveCount; /*Assign the value bestMoveX of to bestMoveX2*/ bestMoveX2 = bestMoveX; /*Assign the value bestMoveY of to bestMoveY2*/ bestMoveY2 = bestMoveY; /*Assign the value nextX of to bestMoveX*/ bestMoveX = nextX; /*Assign the value nextY of to bestMoveY*/ bestMoveY = nextY; } } //Update the values nextX = x + j; nextY = y + i; //Check the condition if (nextX >= 0 && nextX <= SIZE - 1 && nextY >= 0 && nextY <= SIZE - 1 && !moves[nextX][nextY]) { //Call the function moveCount = lookAheadCount(moves, nextX, nextY); /*Check if the value of moveCount is less than or equal to minMoveCount*/ if (moveCount <= minMoveCount) { /*Assign the value moveCount of to minMoveCount*/ minMoveCount = moveCount; /*Assign the value bestMoveX of to bestMoveX2*/ bestMoveX2 = bestMoveX; /*Assign the value bestMoveY of to bestMoveY2*/ bestMoveY2 = bestMoveY; /*Assign the value nextX of to bestMoveX*/ bestMoveX = nextX; /*Assign the value nextY of to bestMoveY*/ bestMoveY = nextY; } } } } //Assign the value of cell to true moves[bestMoveX][bestMoveY] = true; //Call the function addMoveHistory(bestMoveX, bestMoveY); //Increment the variable numMoves++; //Check the condition if (numMoves == (SIZE * SIZE)) //Return true return true; //Check the condition if (moveCount > 0 && solvePuzzle(moves, numMoves, bestMoveX, bestMoveY)) //Return true return true; //Make the cell as false moves[bestMoveX][bestMoveY] = false; //Make the cell as true moves[bestMoveX2][bestMoveY2] = true; //Call the function removeLastMoveHistory(); //Call the function addMoveHistory(bestMoveX2, bestMoveY2); //Check the condition if (moveCount > 1 && solvePuzzle(moves, numMoves, bestMoveX2, bestMoveY2)) //Return true return true; //Make the cell as false moves[bestMoveX2][bestMoveY2] = false...

Introduction to Java Programming and Data Structures, Comprehensive Version Plus MyProgrammingLab with Pearson EText -- Access Card Package

11th Edition

ISBN: 9780134694511

Author: Liang, Y. Daniel

Publisher: Pearson Education Canada

See similar textbooks

Videos

Question

Chapter 18, Problem 18.33PE

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 18, Problem 18.32PE

Chapter 18, Problem 18.34PE

Students have asked these similar questions

No chatgpt please

Please help draw alu diagra

1. Level the resources (R) for the following network. Show exactly which activity is being moved at each cycle and how many days it is being moved. Show all cycles required to utilize the free float and the back float. B H 3 3 L 2 0-0-0 A C F G K N P Q T 0 3 2 2 1 2-2-2 7R 8R 4R 6R 4R 2R 5R 4R D 1 2R 2 M 000 4R 2 4R 1 2 3 4 B5 B BE B 5 5 7 D 2003 C NO C MBSCM В H 5 2 F 7 7 8 SH2F80 5 Н Н 6 7 7L3G4+ 6H2G4 J 4 4 14 8 L K 00 36 9 10 11 12 13 14 15 P 2 Z+ N N 4 4 Z t 2334 4 Σ + M M 4 +

Chapter 18 Solutions

Introduction to Java Programming and Data Structures, Comprehensive Version Plus MyProgrammingLab with Pearson EText -- Access Card Package

Chapter 18.2, Problem 18.2.1CP Chapter 18.2, Problem 18.2.2CP Chapter 18.2, Problem 18.2.3CP Chapter 18.2, Problem 18.2.4CP Chapter 18.2, Problem 18.2.5CP Chapter 18.2, Problem 18.2.6CP Chapter 18.3, Problem 18.3.1CP Chapter 18.3, Problem 18.3.2CP Chapter 18.3, Problem 18.3.3CP Chapter 18.4, Problem 18.4.1CP

Additional Engineering Textbook Solutions

Find more solutions based on key concepts

Like constructors, destructors cannot have a “return” type.

Starting Out with C++ from Control Structures to Objects (9th Edition)

One class is derived from another class. The subclass is the derived class, which means the subclass contains m...

Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)

Binary numbers are important for computer processing and can be represented with two digits 0 and 1. Each 0’s o...

Starting Out with Programming Logic and Design (5th Edition) (What's New in Computer Science)

It is a process of breaking down the string into the components called tokens. The string can be split using th...

Starting Out with Java: From Control Structures through Objects (7th Edition) (What's New in Computer Science)

Fill in the blanks.

Modern Database Management

The “new” keyword requests memory from the system to store an object, and then calls the constructor of the cor...

Java How to Program, Early Objects (11th Edition) (Deitel: How to Program)

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.