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

Implications of the identification state of a model, Identification is clos...

Identification is closely related to the estimation of the model. If an equation is identified, its coefficient can, in general, be statistically estimated. In particula

Find the shortest sequence of moves that is to win the game, You and an opp...

You and an opponent are seated at a table, and on the table is a square board. At each of the four corners of the board, there is a disc, each one red on one side and black on the

Find the nash equilibria - strategic game, Two people are engaged in a join...

Two people are engaged in a joint project. If each person i puts in the e ort xi, a nonnegative number equal to at most 1, which costs her c(x i ), the outcome of the project is wo

Games with strategic moves, Games with Strat e gic M ov es   ...

Games with Strat e gic M ov es   The ideas in this chapters can be brought to life and the students can better appreciate the subtleties of various strategic moves an

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

Case study in game theory - color coordination, Game 1 Color Coordination (...

Game 1 Color Coordination (with Delay) This game should be played twice, once without the delay tactic and once with it, to show the difference between out- comes in the s

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

Determine nash equilibria, Consider the electoral competition game presente...

Consider the electoral competition game presented in Lecture 6. In this game there are two candidates who simultaneously choose policies from the real line. There is a distribution

Procurement auction, A market mechanism during which an object, service, or...

A market mechanism during which an object, service, or set of objects is being purchased, instead of sold, to the auctioneer. The auction provides a selected set of rules which wil

Mutual information, Something in a very game is Mutual information if all p...

Something in a very game is Mutual information if all players realize it. A seemingly straightforward concept, mutual information is insufficient to research most games, since it's

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