Question: can you please write pseudo code (in java language)for this!!! package MazeGame; import java.util. Vector; import java.io.File; import java.io.FileNotFoundException; import java.io.IOException; import java.io.PrintWriter: import java.nio.file.Files;

can you please write "pseudo code" (in java language)for this!!! package MazeGame;can you please write "pseudo code" (in java language)for this!!!

package MazeGame; import java.util. Vector; import java.io.File; import java.io.FileNotFoundException; import java.io.IOException; import java.io.PrintWriter: import java.nio.file.Files; import java.util.ArrayList; import java.util.Collections; import java.util.Scanner; public class GameBoard { private GameCell[][] aBoard; private int n Square Size; private int n StartRow; private int nStartCol; private Vector path=new Vector(); private ArrayList allRoute = new ArrayList(); public GameBoard(String sFileName) throws Exception File file = new File(sFileName); J. ArrayList board = new ArrayList(); Jl Scanner file Scan = new Scanner(file); JL while(file Scan.hasNextLine()). I JL Il board.add(file Scan.nextLine()); } nSquareSize=board.size(); JL aBoard=new GameCell[n Square Size][n Square Size]; Il for(int nRow=0;nRow board = new ArrayList(); Scanner file Scan = new Scanner(file); while(file Scan.hasNextLine()) { board.add(file Scan.nextLine()); nSquare Size=board.size(); aBoard=new GameCelln Square Size][nSquare Size]; for(int nRow=0;nRow board = new ArrayList(); Scanner fileScan = new Scanner(file); while(file Scan.hasNextLine()) board.add(file Scan.nextLine()); return board.size(); ~ public void playGame() { findStart(); Vector path = findPath(nStartRow,nStartCol); JL JL // to store all possible paths ---> not complete yet if(allRoute.size()==0 ) allRoute.add(path); while(allRoute.size()!=2) path = findPath(nStartRow,nStartCol); for(int i=0;i "); m System.out.println(); System.out.println("Cost: "+pathCost(path)); private void findStart() for (int i = 0; i findPath(int nRow,int nCol) int random=(int)(Math.random()*3+1); if(aBoard[nRow][nCol].is End()==true) System.out.println("Yayyy!!!!"); path.add(aBoard[nRow][nCol]); return path; else switch(random) case 1: if(can GoUp(nRow, nCol)) { System.out.println("in cangoup"); aBoard[nRow][nCol].setVisited(true); path.add(aBoard[nRow][nCol]); findPath(nRow-1,nCol);} else if(canGoDown(nRow, nCol)) { System.out.println("in cangodown"); aBoard[nRow][nCol].setVisited(true); path.add(aBoard[nRow][nCol]); findPath(nRow+1,nCol);} else if(can GoLeft(nRow, nCol)) { System.out.println("in cangoleft"); aBoard[nRow][nCol].setVisited(true); path.add(aBoard[nRow][nCol]); findPath(nRow,nCol-1);} else if(can GoRight(nRow, nCol)) { System.out.println("in cangoright"); aBoard[nRow][nCol].setVisited(true); path.add(aBoard[nRow][nCol]); findPath(nRow,nCol+1);} else for (int i = 0; i findPath(int nRow,int nCol) JL { JL if(aBoard[nRow][nCol].isEnd()==true) JL System.out.println("Yayyy!!!!"); path.add(aBoard[nRow][nCol]); return path; JL JL else JL if(canGoUp(nRow, nCol)) JL if(can GoDown(nRow, nColl|can GoLeft(nRow, nColl|canGoRight(nRow, nCol)) { aBoard[nRow][nCol].setCheckPoint(true); } IL System.out.println("in cangoup"); aBoard[nRow][n Col].setVisited(true); if(!(path.contains(aBoard[nRow][nCol]))) {path.add(aBoard[nRow][nCol]);} findPath(nRow-1,nCol); I else if(canGoDown(nRow, nCol)) JL if(can GoUp(nRow, nCol)||can GoLeft(nRow, n Col)||can GoRight(nRow, nCol)) { aBoard[nRow][nCol].setCheckPoint(true); } JL System.out.println("in cangodown"); aBoard[nRow][nCol].setVisited(true); if(!(path.contains(aBoard[nRow][nCol]))) {path.add(aBoard[nRow][nCol]);} findPath(nRow+1,nCol); I else if(can GoLeft(nRow, nCol)) JL if(can GoDown(nRow, nCol)||can GoUp(nRow, nCol)||canGoRight(nRow, nCol)) { aBoard[nRow][nCol].setCheckPoint(true); } JL System.out.println("in cangoleft"); aBoard[nRowlnCol].setVisited(true); if(!(path.contains(aBoard[nRow][nCol]))) {path.add(aBoard[nRow][nCol]);} findPath(nRow,nCol-1); I else if(canGoRight(nRow, nCol)) JL if(canGoDown(nRow, nCol|can GoLeft(nRow, nCol)||can GoUp(nRow, nCol)) { aBoard[nRow][nCol].setCheckPoint(true); } JL System.out.println("in cangoright"); aBoard[nRow][nCol].setVisited(true); if(!(path.contains(aBoard[nRow][nCol]))) {path.add(aBoard[nRow][nCol]);} findPath(nRow,nCol+1); else System.out.println("Path has been changed"); Jl for(int i=path.size()-1;i>=0;i--) if(path.get(i).isCheckPoint() && path.get(i).isCheckUsed()==false) path.get(i).setCheckUsed(true); path.subList(i+1, path.size()).clear(); findPath(path.get(i).getRow(),path.get(i).getCol()); return path; JL } Jl return path; / } protected boolean canGoUp(int n Row,int nCol) if((n Row-1>=0 && nRow-1=0 && nCol-1=0 && nCol+1=0 && nRow+1 obPath) int cost=0; for(GameCell cell:path) switch(cell.getVal()) case '.': cost++; break; case 'D': cost+=75; break; case 'R': cost+=10; break; default: cost+=0; return cost; public void printBoard() for (int i = 0; i path=new Vector(); private ArrayList allRoute = new ArrayList(); public GameBoard(String sFileName) throws Exception File file = new File(sFileName); J. ArrayList board = new ArrayList(); Jl Scanner file Scan = new Scanner(file); JL while(file Scan.hasNextLine()). I JL Il board.add(file Scan.nextLine()); } nSquareSize=board.size(); JL aBoard=new GameCell[n Square Size][n Square Size]; Il for(int nRow=0;nRow board = new ArrayList(); Scanner file Scan = new Scanner(file); while(file Scan.hasNextLine()) { board.add(file Scan.nextLine()); nSquare Size=board.size(); aBoard=new GameCelln Square Size][nSquare Size]; for(int nRow=0;nRow board = new ArrayList(); Scanner fileScan = new Scanner(file); while(file Scan.hasNextLine()) board.add(file Scan.nextLine()); return board.size(); ~ public void playGame() { findStart(); Vector path = findPath(nStartRow,nStartCol); JL JL // to store all possible paths ---> not complete yet if(allRoute.size()==0 ) allRoute.add(path); while(allRoute.size()!=2) path = findPath(nStartRow,nStartCol); for(int i=0;i "); m System.out.println(); System.out.println("Cost: "+pathCost(path)); private void findStart() for (int i = 0; i findPath(int nRow,int nCol) int random=(int)(Math.random()*3+1); if(aBoard[nRow][nCol].is End()==true) System.out.println("Yayyy!!!!"); path.add(aBoard[nRow][nCol]); return path; else switch(random) case 1: if(can GoUp(nRow, nCol)) { System.out.println("in cangoup"); aBoard[nRow][nCol].setVisited(true); path.add(aBoard[nRow][nCol]); findPath(nRow-1,nCol);} else if(canGoDown(nRow, nCol)) { System.out.println("in cangodown"); aBoard[nRow][nCol].setVisited(true); path.add(aBoard[nRow][nCol]); findPath(nRow+1,nCol);} else if(can GoLeft(nRow, nCol)) { System.out.println("in cangoleft"); aBoard[nRow][nCol].setVisited(true); path.add(aBoard[nRow][nCol]); findPath(nRow,nCol-1);} else if(can GoRight(nRow, nCol)) { System.out.println("in cangoright"); aBoard[nRow][nCol].setVisited(true); path.add(aBoard[nRow][nCol]); findPath(nRow,nCol+1);} else for (int i = 0; i findPath(int nRow,int nCol) JL { JL if(aBoard[nRow][nCol].isEnd()==true) JL System.out.println("Yayyy!!!!"); path.add(aBoard[nRow][nCol]); return path; JL JL else JL if(canGoUp(nRow, nCol)) JL if(can GoDown(nRow, nColl|can GoLeft(nRow, nColl|canGoRight(nRow, nCol)) { aBoard[nRow][nCol].setCheckPoint(true); } IL System.out.println("in cangoup"); aBoard[nRow][n Col].setVisited(true); if(!(path.contains(aBoard[nRow][nCol]))) {path.add(aBoard[nRow][nCol]);} findPath(nRow-1,nCol); I else if(canGoDown(nRow, nCol)) JL if(can GoUp(nRow, nCol)||can GoLeft(nRow, n Col)||can GoRight(nRow, nCol)) { aBoard[nRow][nCol].setCheckPoint(true); } JL System.out.println("in cangodown"); aBoard[nRow][nCol].setVisited(true); if(!(path.contains(aBoard[nRow][nCol]))) {path.add(aBoard[nRow][nCol]);} findPath(nRow+1,nCol); I else if(can GoLeft(nRow, nCol)) JL if(can GoDown(nRow, nCol)||can GoUp(nRow, nCol)||canGoRight(nRow, nCol)) { aBoard[nRow][nCol].setCheckPoint(true); } JL System.out.println("in cangoleft"); aBoard[nRowlnCol].setVisited(true); if(!(path.contains(aBoard[nRow][nCol]))) {path.add(aBoard[nRow][nCol]);} findPath(nRow,nCol-1); I else if(canGoRight(nRow, nCol)) JL if(canGoDown(nRow, nCol|can GoLeft(nRow, nCol)||can GoUp(nRow, nCol)) { aBoard[nRow][nCol].setCheckPoint(true); } JL System.out.println("in cangoright"); aBoard[nRow][nCol].setVisited(true); if(!(path.contains(aBoard[nRow][nCol]))) {path.add(aBoard[nRow][nCol]);} findPath(nRow,nCol+1); else System.out.println("Path has been changed"); Jl for(int i=path.size()-1;i>=0;i--) if(path.get(i).isCheckPoint() && path.get(i).isCheckUsed()==false) path.get(i).setCheckUsed(true); path.subList(i+1, path.size()).clear(); findPath(path.get(i).getRow(),path.get(i).getCol()); return path; JL } Jl return path; / } protected boolean canGoUp(int n Row,int nCol) if((n Row-1>=0 && nRow-1=0 && nCol-1=0 && nCol+1=0 && nRow+1 obPath) int cost=0; for(GameCell cell:path) switch(cell.getVal()) case '.': cost++; break; case 'D': cost+=75; break; case 'R': cost+=10; break; default: cost+=0; return cost; public void printBoard() for (int i = 0; i

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

Q:

can you write pesudo code (in java) of the given code!! package MazeGame; import java.util. Vector; import java.io.File; import java.io.FileNotFoundException; import java.io.IOException; import...

Q:

Can someone help me with these Java questions over networking package edu.lmu.cs.networking; import java.io.IOException; import java.io.PrintWriter; import java.net.ServerSocket; import...

Q:

[In JAVA] Implement an Interpreter for the mock language X Interpreter.java package interpreter; import java.io.*; /** * * Interpreter class runs the interpreter: * 1. Perform all initializations *...

Q:

DATABASE CAN BE ACCESSED BY THIS: www.papademas.net/phpmyadmin username = "db411"; password = "411"; Objective To write a program that creates a Loan analysis report from class objects created in lab...

Q:

Calling on my Chegg experts, I need your help on this long difficult task I have to complete this week. Below is the task for this week. Since many people had problems with this weeks task the...

Q:

**********Evaluator.java**************** package evaluator; import java.util.*; import operand.Operand; import operator.Operator; public class Evaluator { private Stack operandStack; private Stack...

Q:

Please help Below is the java codes for the Graph class: import java.io.BufferedReader; import java.io.File; import java.io.FileInputStream; import java.io.FileNotFoundException; import...

Q:

Please write this code for me . i neeed it in java and makw sure you dont change any of the codee already given and implement all the classes and dont remove any of the classes. tysm ! ! this is the...

Q:

**********Evaluator.java**************** package evaluator; import java.util.*; import operand.Operand; import operator.Operator; public class Evaluator { private Stack operandStack; private Stack...

Q:

Fix this Java program so that it does not show the period symbol before each value that was read in from the excel file. I am reading in an excel file using Apache POI but the output shows a period...

Q:

Betty and Bob are old age pensioners living in Carlton. Early in 2022 they decided to holiday in Queensland later in the year and so began searching on the internet for suitable accommodation. When...

Q:

To prevent decay by bacterial species and to display the mummified remains of ancient peoples, museum official place mummies in glass cases where oxygen has been replaced with nitrogen gas. Why do...

Q:

Question 1 ( 1 point ) Capital budgeting measures the budget deficit as: Question 1 options: liabilities minus assets forecasted liabilities minus forecasted assets change in liabilities minus change...

Q:

The first scenario will be a Verbal Judo scenario in which your scenario follows the standard Verbal Judo interaction: You need to ask somebody to modify their behavior either to do something or to...

Q:

(Appendices) Although workers compensation laws differ among the states, they have certain common features. Explain whether each of the following persons would be eligible for workers compensation...

Q:

(Appendices) James currently earns $3,000 per month. He has an individual disability income policy that will pay $1,800 monthly if he is totally disabled. The policy has a 60-day elimination period...

Q:

(Appendices) There is no single solution to reducing or eliminating the long-range actuarial deficit in the Social Security program. The Academy of Actuaries has a game that allows viewers to make...