FREE Trial
Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

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;

image text in transcribedcan 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

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Object Databases The Essentials

Object Databases The Essentials

Authors: Mary E. S. Loomis

1st Edition

020156341X, 978-0201563412

More Books

Students also viewed these Databases questions

Question

★★★★★
A natural history museum borrows $2,000,000 at simple annual interest to purchase new exhibits. Some of the money is borrowed at 7%, some at 8.5%, and some at 9.5%. Use a system of linear equations...

Answered: 1 week ago

Question

★★★★★
In general, an atom can have both orbital angular momentum and spin angular momentum. The total angular momentum is defined to be J(vector) = L(vector) + S(vector). The total angular momentum is...

Answered: 1 week ago

Question

★★★★★
=+ (d) Show that \, (He 0) =0 and A*(H) =1.

Answered: 1 week ago

Question

★★★★★
After closing its books on December 31, Pro Parts' stockholders' equity accounts had the following balances: Common stock subscriptions receivable ........... $ 5,000 Common stock, $5 par, 12,000...

Answered: 1 week ago

Question

★★★★★
35 pts Use the following Information to Answer the questions Below 1) Jan 1, Our Business Authorired 200,000 shares of $1 Par value stock 2) Jan 2, Our Business issued 60,000 shares of common stock...

Answered: 1 week ago

Question

★★★★★
What is the impact over the next two years on net interest income if interest rates on RSAS? increase 50 basis points and on RSLS increase 75 basis points? ?l1= ($150m + $150m + $100+ $50) (005) =...

Answered: 1 week ago

Question

★★★★★
QUESTION 4 (b) Read the following scenarios: (i) (ii) (iii) Delphine & Co. is a law firm which had been operating for the past 20 years. The firm has over 200 active clients, mainly commercial...

Answered: 1 week ago

Question

★★★★★
State the uses of job description.

Answered: 1 week ago

Question

★★★★★
Define and explain two of the four pieces to Lessig's Framework. I should see how you understand how Lessig's Laws apply to the IT world. (Minimum of two paragraphs)Thank you

Answered: 1 week ago

Question

★★★★★
Explain in detail the different methods of performance appraisal .

Answered: 1 week ago

Question

★★★★★
In a particular county, the average number of suicides reported each month is 2.75. Assume that the number of suicides follows a Poisson distribution. What is the probability that at least two (two...

Answered: 1 week ago

Question

★★★★★
(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...

Answered: 1 week ago

Question

★★★★★
(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...

Answered: 1 week ago

Question

★★★★★
(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...

Answered: 1 week ago

Previous Question Next Question