Write two methods for the mouse trap game, Game Theory

Assignment Help:

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).

 

 


Related Discussions:- Write two methods for the mouse trap game

Uniform worth, A uniform worth auction may be a multiunit auction during wh...

A uniform worth auction may be a multiunit auction during which each winning bidder pays identical worth, which can or might not be equal to the participants' bids. Alternatively,

Bayesian Cournot, Consider the Cournot duopoly model in which two firms, 1 ...

Consider the Cournot duopoly model in which two firms, 1 and 2, simultaneously choose the quantities they will sell in the market, q1 and q2. The price each receives for each unity

Dominant strategy equilibrium, The following is a payoff matrix for a non-c...

The following is a payoff matrix for a non-cooperative simultaneous move game between 2 players. The payoffs are in the order (Player 1; Player 2): What is the Dominant Strat

Ordinally symmetric game, Ordinally Symmetric Game Scenario Any game dur...

Ordinally Symmetric Game Scenario Any game during which the identity of the player doesn't amendment the relative order of the ensuing payoffs facing that player. In different w

Bidding ring, A set of colluding bidders. Ring participants agree to rig bi...

A set of colluding bidders. Ring participants agree to rig bids by agreeing not to bid against each other, either by avoiding the auction or by placing phony (phantom) bids.

Computer game zenda, Computer Game Zenda This game was invented by Jame...

Computer Game Zenda This game was invented by James Andreoni and Hal Varian; see their article, "Pre-Play Contracting in the Prisoners 'Dilemma".The paper also contains some co

Game:claim a pile of dimes, GAME 1 Claim a Pile of Dimes Two players A...

GAME 1 Claim a Pile of Dimes Two players Aand B are chosen. The instructor places a dime on the table. Player A can say Stop or Pass. If Stop, then A gets the dime and the gam

Deadlock , Description The simplest of William Poundstone's social dilem...

Description The simplest of William Poundstone's social dilemmas during which the every player contains a dominant strategy and also the equilibrium is Pareto optimal. the sole

Formal rules for identification, Identification may be established either ...

Identification may be established either by the examination of the specification of the structural model, or by the examination of the reduced form of the model. Traditionally

Identification problem, Identification is a problem of model formultion, ra...

Identification is a problem of model formultion, rather than inf nlnde! estimation or appraisal. We say a model is identified if it is in a unique statistical form, enabling unique

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd