Write two methods for the mouse trap game, Game Theory

Write two methods for the mouse trap game (using your board created in Assignment 3) and an event handler (another method) to test the two methods.

1. world.raise(item) where raise is a world-level method with one object-type parameter named "item". The method will raise the object item that is passed as the argument. This method will be used to raise obstacles to trap the mouse (or other vermin), so the distance that the object item is raised will depend on the size of the obstacles in your world.

2. mouse.jump(target) where jump is a method for the mouse (or other vermin) object with one object-type parameter named target. The method will cause the mouse to jump from its current position to the target position. You should have the mouse turn in the direction of its jump before jumping so that it is a realistic jump.

3. hw5(item) where hw5 is an event handler to test your methods with one object-type parameter named item. The event handler will respond to the mouse click event as: "When the mouse is clicked on anything do hw5(object_under_mouse_cursor)". The event handler will examine a world-level variable (that you must create) named "count" for conditional execution. If the value of count is 0, then the event handler will call world.raise(item) to raise the object that the user clicked, then set the value of count to 1. If the value of count is 1, then the event handler will call mouse.jump(item) to have the mouse jump to the object that the user clicked, then set the value of
count to 0. In the method that is called when the world starts, set the world-level variable count to 0. Then, when the user first clicks on a place on the board, that place will be raised. When the user next clicks on a place on the board, the mouse (or other vermin) will move to that place. In subsequent clicks, the sequence of raising an obstacle and moving the mouse will repeat. Of course, when the game is finished, there will be testing to make sure that only obstacles are raised and that obstacles are raised only once and the user will not move the mouse, but we are building modules that will be used in the finished game. Thus, you will be able to do things that you will take care of in a future assignment (such as making sure not to raise a cylinder that is already raised, etc).

 

 

Posted Date: 3/25/2013 5:35:42 AM | Location : United States







Related Discussions:- Write two methods for the mouse trap game, Assignment Help, Ask Question on Write two methods for the mouse trap game, Get Answer, Expert's Help, Write two methods for the mouse trap game Discussions

Write discussion on Write two methods for the mouse trap game
Your posts are moderated
Related Questions
Find Pure Nash Equilibria 1. Consider a two-player game in which player 1 chooses the strategy x 1 from the closed interval [-1, 1] while player 2 chooses the strategy x 2 fr

Consider a game in which player 1 chooses rows, player 2 chooses columns and player 3 chooses matrices. Only Player 3''s payoffs are given below. Show that D is not a best response

Consider the following three games (Chicken, Matching Pennies, Stag Hunt): Chicken Player 2 Player 1 D V D -100;-100 10;-10 V -10; 10 -1;-1 Matching Pennies Pla

Living from 1845 to 1926, Edgeworth's contributions to Economics still influence trendy game theorists. His Mathematical Psychics printed in 1881, demonstrated the notion of compet

Exercise 1 a) Pure strategy nash equilibrium in this case is Not Buy, bad ( 0,0) as no one wants to deviate from this strategy. b) The player chooses buy in the first perio

1. Consider a two-player game where player A chooses "Up," or "Down" and player B chooses "Left," "Center," or "Right". Their payoffs are as follows: When player A chooses "Up" and

i have to make a tic tac toe game in matlab i dun have any idea what to do?

A Nash equilibrium, named when John Nash, may be a set of methods, one for every player, such that no player has incentive to unilaterally amendment her action. Players are in equi

A strategy consisting of potential moves and a chance distribution (collection of weights) that corresponds to how frequently every move is to be played. A player would solely use

A general term for an English auction in which there is no reserve price, guaranteeing that the object will be sold to the highest bidder regardless of the quantity of the bid.