Set challenge-eliminated-list lput (list winning-contestant eliminated-contestant) challenge-eliminated-listĮnd completes bookwork required to eliminate a contestant to eliminate turtle procedure Post-Merge: entire merged tribe votes to eliminate a contestant Set challenge-eliminated-list lput (list winning-tribe eliminated-contestant) challenge-eliminated-list Set total-votes-against total-votes-against + votes-against Print word "Tribe " word (1 - winning-tribe) " Tribal Council:"įoreach sort-on of vote)] contestants with [ the-contestant ->Īsk contestants with [ Pre-Merge: losing tribe votes to eliminate a contestant If log? of winning-contestant " Won Challenge" ]Įnd calculates which contestant to eliminate from the game based on votes to tribal-council Set individual-challenge-wins individual-challenge-wins + 1 Set winning-contestant rnd:weighted-one-of contestants with If social > 40 and social 90 or social last t ] Set archetypes lput "Balanced" archetypes Set loyalty minimum-loyalty + random-float (1 - minimum-loyalty)Įnd adds labels to contestants for later analysis to set-archetypes turtle procedure If count contestants with = num-contestants / 2 + 2 and phase = 0 Įnd creates a contestant with random attributes to contestant-constructor turtle procedure Setxy (random max-pxcor / 2) + max-pxcor / 2 (social / 100) * (max-pycor * 2) - max-pycor Setxy (- (random max-pxcor / 2)) - max-pxcor / 2 (social / 100) * (max-pycor * 2) - max-pycorĬreate-contestants num-contestants / 2 [ create second tribe Repeat-experiment-finishes-table table of each contestants finishesĬreate-contestants num-contestants / 2 [ create first tribe Winning-tribe most recent tribal challenge winnerĬhallenge-eliminated-list list of challenge winner, eliminated contestant pairsĬontestant-experiment-finishes list of my-contestant's finishes Winning-contestant most recent individual challenge winner
Phase 0:challenge -> 1:tribal-council -> 2:update social game -> repeatĮliminated-contestant most recent eliminated contestant Individual-challenge-wins for resume outputĮlimination-score for voting-history output
Can someone help with this please.Undirected-link-breed Then, it should keep going until everyone are friends I think. My who = 6 and my friends are my who = 2 and my friends are my who = 7 and my friends are my who = 5 and my friends are my who = 0 and my friends are my who = 4 and my friends are my who = 8 and my friends are my who = 9 and my friends are my who = 3 and my friends are my who = 1 and my friends are My who = 4 and my friends are my who = 1 and my friends are my who = 9 and my friends are my who = 8 and my friends are my who = 7 and my friends are my who = 2 and my friends are my who = 3 and my friends are my who = 6 and my friends are my who = 5 and my friends are my who = 0 and my friends are Īnd then the next time you press the go button it should output this and so on I don't understand what to do for the go procedure though this is what the output should look like for each tick.įor instance, on the first tick the console should output this The setup procedure is not difficult, so I did The list must NOT contain duplicate numbers or the owner’s who number. If B is not yet in A’ list, use lput to add B’s who number. Use foreach to iterate through the list, and determine if B’s who number is already in the list. If a turtle A meets another turtle B it has not met before, then turtle A adds B’s “who” number to the end of A’s list. In each tick, every turtle randomly selects another turtle to interact (use one-of and other) Includes the “usual” commands (clear-all and resetticks in setup, tick in go, etc.)Įach turtle stores an initial empty list. My assignment is to do this.Ĭreates 10 turtles (any color) at the center (0,0) Hey, I figured there would be people on here with experience on NetLogo.
0 kommentar(er)
