Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re: Hierarchical Data Structures

by ehdonhon (Curate)
on Mar 11, 2004 at 07:02 UTC ( #335737=note: print w/ replies, xml ) Need Help??


in reply to Hierarchical Data Structures

Does player A have to appoint all 3 people below it, or can it choose to only appoint one or two?

When play A swaps, does it have to be with player B, or does it have the choice of also swapping with players C or D? Can it then immediately swap with one of the grandchildren (which would mean that you can basically put every piece in any position any day)?

After you have objects to represent all of this, how do you plan on solving it? It sounds to me like one of those problems that isn't going to be solvable with brute force.


Comment on Re: Hierarchical Data Structures
Re: Re: Hierarchical Data Structures
by TomDLux (Vicar) on Mar 12, 2004 at 02:26 UTC

    Any problem is solvable by brute force, given enough time ... for some definition of enough.

    --
    TTTATCGGTCGTTATATAGATGTTTGCA

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://335737]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (11)
As of 2014-07-29 12:21 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (217 votes), past polls