Animal puzzle, Game Theory

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

Posted Date: 4/6/2013 2:35:12 AM | Location : United States







Related Discussions:- Animal puzzle, Assignment Help, Ask Question on Animal puzzle, Get Answer, Expert's Help, Animal puzzle Discussions

Write discussion on Animal puzzle
Your posts are moderated
Related Questions
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,

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

This chapter introduces mixed strategies and the methods used to solve for mixed strategy equilibria. Students are likely to accept the idea of randomization more readily if they t

Combining Simultaneous and  Sequential Moves The material in this chapter covers a variety of issues that require some knowledge of the analysis of both sequential- move

A sub game excellent Nash equilibrium is an equilibrium such that players' methods represent a Nash equilibrium in each sub game of the initial game. it should be found by backward

1. The town of Sunnydale, CA is inhabited by two vampires, Spike and Anya. Each night Spike and Anya independently hunt for food, which each one finds with probability 1/2 . Becaus

A game tree (also referred to as the in depth form) may be a graphical illustration of a sequential game. It provides data concerning the players, payoffs, strategies, and also the

A type of sequential second worth auction during which an auctioneer directs participants to beat the present, standing bid. New bids should increase the present bid by a predefine

Normal 0 false false false EN-US X-NONE X-NONE

Two individuals, Player 1 and Player 2, are competing in an auction to obtain a valuable object. Each player bids in a sealed envelope, without knowing the bid of the other player.