Animal puzzle, Game Theory

Assignment Help:

a) This you just have to list all the attributes for the program. i.e. unique id's for puzzle pieces, attributes for the puzzle like a data field for the number of edges, methods that you will use on the puzzle pieces like a rotate method, boolean attributes for tracking which pieces have been used/checked. we also had an array to store the edges in that match the current pieces edges

b) in here we talked about the notation to represent the puzzle piece. I see you have shapes with pictures of pigs on them You will need to have a notation that describes each side i.e. the orientation of the pig, the colour and whether it is a head or tail you could use - T, R, L (a Tail which is red and is pointed left) Therefore a shape could be described by combining 3 of these for a triangle or 8 for the octagon. there are several alternatives to this we figured out the total possible number of different edges i.e. how many different combinatiosn of colour, end/head and orientation there could be (think it was 16) and assigned numbers to them. so 1-8 was for all the heads of different colours and different orientations and then -1 to -8 was for the tails of the same colour and orientation. this was good because when two edges matched adding their number would equal 0 and we would know they matched. we also found it necessary to have a data structure for the pattern that the pieces would form we called this 'slot' and this was used to show connections between pieces that were required to form the final structure.  

c) This is simply formalising the data structure you created in part b. using the data structure for a write a file that can represent a set of pieces. think about whether you want it to all be on one line or be seperated by piece. you need to write it out like you will feed it into the program d) Are you going to use brute force? or is there a more effectient way to do it? For ours we had an array where each index had a piece and that piece had to match with several other indexes piece by matching sides to make the shape. We did this by comparing sides to see if they matched, if they didnt we rotated the piece and checked again, we did this over and over until we found a solution or had checked every piece in every postion in every rotation

our total routine was to initialise variables, i.e. read in the file with piece info, construct a list of possible matches for each edge on each piece then the last step was to match these up and see if the fitted in the slot pattern


Related Discussions:- Animal puzzle

Backward induction, Backward induction is an iterative procedure for resolv...

Backward induction is an iterative procedure for resolving finite general form or sequential games. First, one decides the finest policy of the player who makes the last move of th

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

Positive add, In a positive add game, the combined payoffs of all players a...

In a positive add game, the combined payoffs of all players aren't identical in each outcome of the sport. This differs from constant add (or zero add) games during which all outco

Cournot and Stackelberg., Consider two identical firms, for each firm, the ...

Consider two identical firms, for each firm, the total cost of producing q units of output is C(q)=0.5q^2. The price is determined as P(q1,q2)- a-q1-q2. Estimate Cournots outcome;

nim game, Matches or different objects are organized in 2 or a lot of pile...

Matches or different objects are organized in 2 or a lot of piles. Players alternate removing some or all of the matches from anyone pile. The player to get rid of the last match w

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

Strategies against hostage takers, Strategies against Hostage Takers T...

Strategies against Hostage Takers T ypical Situations Terrorists: usually have several hostages, demands are polit- ical, may be fanatics, location may be public or sec

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

Compute pure strategy and mixed strategy equilibria of game, Ronaldo (Brazi...

Ronaldo (Brazil) kicks a penalty against Casillas (Spain) in the 2006 World Cup nal. Sup- pose that Ronaldo can kick the ball to Casillas' upper left (UL), lower left (LL), upper r

Prisoners’ dilemma game, The Prisoners’ Dilemma Game The idea th...

The Prisoners’ Dilemma Game The idea that tacit cooperation can be sustained in an ongoing relationship is very simple and students easily accept it. The formal analysis

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