BlogNomic: The First Dynasty of Desertfrog

Replace the rule “Doing the Dance’ with:

The Dance consists of a set of moves, contributed by the monkeys. Each move has a name, an integer complexity, and a description. The current dance is outlined on the ‘Monkey Dynasty Gamestate Documents’ of the wiki page. There should be one section on that wiki page for each active monkey. There is a stat in the GNDT called ‘Dance Moves’, which is five by default except for the Top Banana who starts with ten dance moves. Each monkey may add dance moves to their section of the dance with a total complexity up to N, where in is N is their number of dance moves. Only moves outlined within this rule may be added to the dance. Dance moves must be referred to by their name, not by their description. If a word in one of the outlined moves is produced by ‘n_’ it may be replaced by any positive integer number when being added to a section of the dance. When doing so, the same word should be replaced by the same value. (So ‘n_A n_B n_A’ could be replaced by ‘3 7 3’ or ‘3 3 3’ but not ‘3 3 7’) The same move may be added to the same section of the dance more than once.

If no other monkey has done so within the last forty eight hours, and the monkey doing so has not updated their section of the dance within the last six hours, and if the Line is not Unbalanced, then a monkey may conduct the dance. To do so, e randomly puts all of the active monkeys into a list. (This list is different than the monkey line). E then takes the first monkey on that list and follows each of the dance moves for that monkeys section, in order. If the Line becomes Unbalanced, the Unbalance must be corrected before processing the next Dance move. If the monkey has more moves in eir section of the dance than dance moves, only the first N moves are followed where in is that monkey’s number of dance moves. After conducting all of the moves for the first monkey, the monkey conducting the dance proceeds to the next monkey in line, following the same steps as outlined above. E continues to do this until the dance section for every monkey has been executed. E must then make a post to the blog saying e has preformed the dance, a provide a link to a Wiki page outlining the changes that were made.

The following dance moves may be included in the dance:

  * Name: ‘‘Swing n_A to n_B’‘; Complexity: 1; Description: Swap the monkey in position n_A with the monkey in position n_B.
  * Name: ‘‘Leap’‘; Complexity: 1; Description: Move the monkey in last position to the top of the list, pushing every other monkey down one.
  * Name: “Bow”; Complexity: 2; Description: If the monkey in the first position does not have the most dance moves(tied for the most is acceptable), increase that monkey’s dance moves by one.

If the proposal “naming the steps” passes, add the following to the end of this rule

  * Name: ‘‘Thump’‘; Complexity: 5; Description:  The dance moves of the Monkey one position in front of this Monkey (if there is one) are skipped, for this dance (unless they’ve already been processed).
  * Name: ‘‘Kick’‘; Complexity: 5. Description: The dance moves of the Monkey one position behind this Monkey (if there is one) are skipped, for this dance (unless they’ve already been processed).
  * Name: ‘‘Freeze’‘; Complexity: 3; Description: If this Monkey is not in position n_A, then stop processing its dance moves.

If the proposal “Banana Grabbing” Passes add the following to the end of this rule

  *Name: ‘‘Right Swap from n_A”; Complexity: 2; Description: Transfer 1 banana from the monkey in position n_A to the monkey in position n_A+1.
  *Name: ‘‘Left Swap from n_A”; Complexity: 2; Description: Transfer 1 banana from the monkey in position n_A to the monkey in position n_A-1.
  *Name: ‘‘Center Swap on n_A”; Complexity: 3; Description: Transfer to the monkey in positions n_A+1 and n_A-1 one banana each from the monkey in position n_A.

If the proposal STOP! Hammer Time passes, add the following to the end of this rule

*Name: ‘‘Left Smash from n_A”; Complexity: 2; Description: The monkey in position n_A uses their hammer on the monkey in position n_A-1
*Name: ‘‘Right Smash from n_A”; Complexity: 2; Description: The monkey in position n_A uses their hammer on the monkey in position n_A+1