Python Programming: An Introduction to Computer Science
Python Programming: An Introduction to Computer Science
3rd Edition
ISBN: 9781590282779
Author: John Zelle
Publisher: Franklin Beedle & Associates
Question
Book Icon
Chapter 10, Problem 15PE
Program Plan Intro

Cannonball animation

Program Plan:

Tracker.py:

  • Import the required packages.
  • Definition of class “Tracker”.
    • Condition to show the ball in the window.
    • Create an object to report the current position.
    • Condition to track the X and Y position.
    • Calling the Point using the position.
    • Determining the size.
    • Call the method Circle.
  • Definition of method “initializeTracker ()”.
    • Get the size of the ball.
    • Setting the color of the ball.
    • Draw the window.
  • Definition of method “move”.
    • Tracking the current position.
    • Call the method Point by passing the parameter.
    • Call the method “initializeTracker()”.
  • Definition of “getPosition()”.
    • Return the center value

Main.py:

  • Import the require packages.
  • Definition of method “main()”.
    • Create an interface.
    • Call the method “Tracker()”.
    • Check the condition “getY” greater than or equal to “0”.
      • Call the update method.
      • Get the “x” and “y” position.
      • Move the ball.
      • Print the position.
  • Call the main method.

Blurred answer
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
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
CMPTR
Computer Science
ISBN:9781337681872
Author:PINARD
Publisher:Cengage
Text book image
Programming with Microsoft Visual Basic 2017
Computer Science
ISBN:9781337102124
Author:Diane Zak
Publisher:Cengage Learning
Text book image
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:9781337508841
Author:Carey
Publisher:Cengage
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781305480537
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT