Build GUI using Button class Program Plan: Import the required packages. Declare a main function. Inside the main function, Create the application window. Create a button for Random Walk and Quit. Call the method “activate()”. Call the method “deactivate()” Call the method “getMouse()” and store the value in variable “pt”. Set the point using the method “Point()”. Check whether the quit button is not clicked. Call the method “deactivate()”. Pass the parameters to the method “randWalk()”. Call the method “activate()”, “deactivate()” and “getMouse()”. Check the condition and call the method “getMouse()” and store the value in the variable “pt”. Set the points using the method “Point()”. Close the window. Definition of method “randWalk()”. Assign “point” to “loc2”. Traverse the for loop until “i” reaches range “100”. Get the position of “x” and “y”. Call the method “Line()” by passing two parameter. Call the method draw. Assign “loc2” to “loc1”. Definition of method “simOneStep()”. Call the method random to determine he angle. Determine the value of “x” and “y”. Return the value of the point. Call the main function.

Question

Want to see the full answer?

Answer 1

Question

Chapter 10, Problem 2PE

Program Plan Intro

Build GUI using Button class

Program Plan:

Import the required packages.

Declare a main function. Inside the main function,

Create the application window.

Create a button for Random Walk and Quit.

Call the method “activate()”.

Call the method “deactivate()”

Call the method “getMouse()” and store the value in variable “pt”.

Set the point using the method “Point()”.

Check whether the quit button is not clicked.

Call the method “deactivate()”.

Pass the parameters to the method “randWalk()”.

Call the method “activate()”, “deactivate()” and “getMouse()”.

Check the condition and call the method “getMouse()” and store the value in the variable “pt”.

Set the points using the method “Point()”.

Close the window.

Definition of method “randWalk()”.

Assign “point” to “loc2”.

Traverse the for loop until “i” reaches range “100”.

Get the position of “x” and “y”.

Call the method “Line()” by passing two parameter.

Call the method draw.

Assign “loc2” to “loc1”.

Definition of method “simOneStep()”.

Call the method random to determine he angle.

Determine the value of “x” and “y”.

Return the value of the point.

Call the main function.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

solve this questions for me .

a) first player is the minimizing player. What move should be chosen?b) What nodes would not need to be examined using the alpha-beta pruning procedure?

Consider the problem of finding a path in the grid shown below from the position S to theposition G. The agent can move on the grid horizontally and vertically, one square at atime (each step has a cost of one). No step may be made into a forbidden crossed area. Inthe case of ties, break it using up, left, right, and down.(a) Draw the search tree in a greedy search. Manhattan distance should be used as theheuristic function. That is, h(n) for any node n is the Manhattan distance from nto G. The Manhattan distance between two points is the distance in the x-directionplus the distance in the y-direction. It corresponds to the distance traveled along citystreets arranged in a grid. For example, the Manhattan distance between G and S is4. What is the path that is found by the greedy search?(b) Draw the search tree in an A∗search. Manhattan distance should be used as the