Ritual: creating Chiefs If an Explorer sees a Marker with no scepter, it becomes a Disciple and stops moving./ A Rupestrian Algorithm
Ritual: creating Chiefs If an Explorer sees a Marker with no scepter, it becomes a Disciple and stops moving./ A Rupestrian Algorithm
Ritual: creating Chiefs If an Explorer and a Chief bump into each other, they swap their states (equivalently, they switch positions)./ A Rupestrian Algorithm
Ritual: creating Chiefs If an Explorer and a Chief bump into each other, they swap their states (equivalently, they switch positions)./ A Rupestrian Algorithm
Ritual: creating Chiefs If an Explorer sees a Disciple, it becomes a Disciple, as well. / A Rupestrian Algorithm
Ritual: creating Chiefs If an Explorer sees a Disciple, it becomes a Disciple, as well. / A Rupestrian Algorithm
Ritual: Unique Leader case If a Chief reaches a Marker who still has the scepter, he acquires the scepter and becomes Unique Leader./ A Rupestrian Algorithm
Ritual: Unique Leader case If a Chief reaches a Marker who still has the scepter, he acquires the scepter and becomes Unique Leader./ A Rupestrian Algorithm
Ritual: Unique Leader case If a Chief reaches a Marker who still has the scepter, he acquires the scepter and becomes Unique Leader./ A Rupestrian Algorithm
Ritual: Unique Leader case If a Chief reaches a Marker who still has the scepter, he acquires the scepter and becomes Unique Leader./ A Rupestrian Algorithm
Ritual: Unique Leader case The Unique Leader goes around the initial line, and all who see him become Followers./ A Rupestrian Algorithm
Ritual: Unique Leader case The Unique Leader goes around the initial line, and all who see him become Followers./ A Rupestrian Algorithm
Ritual: Unique Leader case The Unique Leader goes around the initial line, and all who see him become Followers./ A Rupestrian Algorithm
Ritual: Unique Leader case The Unique Leader goes around the initial line, and all who see him become Followers./ A Rupestrian Algorithm
Ritual: Unique Leader case If two villagers try to move to the same spot, only one succeeds (chosen at random)./ A Rupestrian Algorithm
Ritual: Unique Leader case If two villagers try to move to the same spot, only one succeeds (chosen at random)./ A Rupestrian Algorithm
Ritual: Unique Leader case If two villagers try to move to the same spot, only one succeeds (chosen at random)./ A Rupestrian Algorithm
Ritual: Unique Leader case If two villagers try to move to the same spot, only one succeeds (chosen at random)./ A Rupestrian Algorithm
Ritual: Unique Leader case If two villagers try to move to the same spot, only one succeeds (chosen at random)./ A Rupestrian Algorithm
Ritual: Unique Leader case Each member of the queue waits for the next member to reach him, and then takes another step./ A Rupestrian Algorithm
Ritual: Unique Leader case Each member of the queue waits for the next member to reach him, and then takes another step./ A Rupestrian Algorithm
Ritual: Unique Leader case Each member of the queue waits for the next member to reach him, and then takes another step./ A Rupestrian Algorithm
Ritual: Unique Leader case Each member of the queue waits for the next member to reach him, and then takes another step./ A Rupestrian Algorithm
Ritual: Unique Leader case Eventually, all the active villagers become part of the line and can start the migration./ A Rupestrian Algorithm
Ritual: Opposing Leaders case If the Markers give their scepters to two different Explorers, two Chiefs are created./ A Rupestrian Algorithm
Ritual: Opposing Leaders case If two Chiefs meet, they become Opposing Leaders and switch directions./ A Rupestrian Algorithm
Ritual: Opposing Leaders case If two Chiefs meet, they become Opposing Leaders and switch directions./ A Rupestrian Algorithm
Ritual: Opposing Leaders case The Opposing Leaders walk around the initial line collecting everyone, until they meet again on the other side./ A Rupestrian Algorithm
Ritual: Opposing Leaders case Now their goal is to determine a winner by comparing the sizes of their respective queues./ A Rupestrian Algorithm
Ritual: Opposing Leaders case To this end, they send a message to their respective Follower, which is forwarded all the way to the tail./ A Rupestrian Algorithm
Ritual: Opposing Leaders case To this end, they send a message to their respective Follower, which is forwarded all the way to the tail./ A Rupestrian Algorithm
Ritual: Opposing Leaders case Then the message bounces back and goes to the head again. / A Rupestrian Algorithm
Ritual: Opposing Leaders case Then the message bounces back and goes to the head again. / A Rupestrian Algorithm
Ritual: Opposing Leaders case The first Opposing Leader to get the message back is the loser, and becomes a Follower./ A Rupestrian Algorithm
Ritual: Opposing Leaders case The other Opposing Leader becomes then the Unique Leader, and guides the procession./ A Rupestrian Algorithm
Ritual: Opposing Leaders case The other Opposing Leader becomes then the Unique Leader, and guides the procession./ A Rupestrian Algorithm
Ritual: Opposing Leaders case The other Opposing Leader becomes then the Unique Leader, and guides the procession./ A Rupestrian Algorithm
Ritual: Opposing Leaders case The other Opposing Leader becomes then the Unique Leader, and guides the procession./ A Rupestrian Algorithm
Ritual: Opposing Leaders case The other Opposing Leader becomes then the Unique Leader, and guides the procession./ A Rupestrian Algorithm
Ritual: Opposing Leaders case The other Opposing Leader becomes then the Unique Leader, and guides the procession./ A Rupestrian Algorithm
Ritual: Opposing Leaders case The other Opposing Leader becomes then the Unique Leader, and guides the procession./ A Rupestrian Algorithm
Ritual: Opposing Leaders case The other Opposing Leader becomes then the Unique Leader, and guides the procession./ A Rupestrian Algorithm
Ritual: Opposing Leaders case However, if one of the two queues bends, its head is automatically declared the winner, even if that queue is shorter./ A Rupestrian Algorithm
Recommend
More recommend
