/////////Main Class/////// public class mainRuby { public static void main(String[] args) { Rubyg ruby=new Rubyg(); } } /////////Algorthm Class/////// import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Queue; import javafx.scene.paint.Color; import javax.swing.JButton; import javax.swing.JOptionPane; public class RubyAlgorithm { // define length and width dimension of Array public static int length=20; public static int width=20; public static int[][]bo=new int [20][20]; // define 2 arrays to control any movement static int new_i[]={-1,0,1,0,1,-1,1,-1}; static int new_j[]={0,-1,0,1,-1,-1,1,1}; // to check if is valid to move to the next button or not public static boolean isValid(JButton zorar[][],boolean visited[][],int new_i,int new_j){ return ((new_i>=0)&&(new_i=0)&&(new_j q=new ArrayDeque<>(); //****************** start action ************** visited[i][j]=true; // make it visited // adding new node for the queue q.add(new Node(i,j,0,null)); int min_dist=Integer.MAX_VALUE; // define min_dist as amaximum value Node node=null; // define new node to be aparent /************** start the loop **********/ while(!q.isEmpty()){ node=q.poll(); // to remove the first node from the queue i=node.x; j=node.y; int dist=node.dist; // check the end if(i==x&&j==y){ min_dist=dist; break; //to break the loop and go out } // for any movement for(int k=0;k<8;k++){ if(isValid(zorar, visited, i+new_i[k], j+new_j[k])) { visited[i+new_i[k]][j+new_j[k]]=true; q.add(new Node(i+new_i[k],j+new_j[k],dist+1,node)); } } } //*********************the end of the loop*********************// if(min_dist!=Integer.MAX_VALUE){ // to get all indeces of the short path of nodes printPath(node); // to give the short path color for (int v=0;v

Roby Game