Mafiascum.net

• Not_Mafia
  
  
• Farren
  
  
• Rockhopper
  
  
• Nancy Drew 39
  
  
• StrangerCoug

• Not_Mafia

• Game 1: Implosion
  
• Game 2:
  Analysis: Not_Mafia & Micc
  
  
• Game 3:
  Dynamics: lilith2013 & skitter30
  
  
• Game 4:
  Exsecant: Sirius9121 & Nancy Drew 39

• You start with 7 cards
  
• On your turn, play some cards in only one of these ways:
  • Start one new sequence with
    at least 3 cards
    : "I'm playing 3, 9, 18 for divisible by 3." You are welcome to include a closed form if you can like { 3 | n } but you must translate this into English for the rest of the players.
    
  • Continue one sequence you previously started: "I'm adding a 3 to my primes"
    
  • Steal one sequence from somebody else: "I'm adding 4, and 16 to Plotinus' powers of 2"
• When the sequence has at least 7 cards in it, it is finished. You get n points, for finishing it, where n is the number of cards in the sequence, and the sequence is removed from the game.
  
• After your turn I replenish your hand up to 7 cards so you can be thinking about your next move while the other players go.
  
• If you cannot think of anything at all to do on your turn, and it's your very first turn of your very first game, then you may post your hand for others to help you. After your first turn is over, you may not reveal your hand.
  
• If all players pass consecutively the game is over and whoever has the most points wins.
  
• If the deck runs out of cards and the players run out of cards then the game is over.

• Most sequences are valid if you can tell us what the rule is. The rule does not have to be number theoretic; cosmetic rules are fine. They can be as complicated or as simple as you like, though for complicated ones it is worth checking the deck to make sure there are at least 7 such numbers. You don't need to collect the numbers of the sequence in order. There are just a few exceptions:
  
• A sequence is a set of numbers that all have something in common with each other. Numbers may not be excluded from sequences they would naturally belong to, for example "primes except 7".
  
• The rules for a sequence must apply to at least 10 unique cards in the deck.
  
• Variants of "all integers", "numbers less than 1001", "random numbers" -- these are all equivalent to "player 1 starts the game with 7 points for no reason"
  
• Repeats: if someone has already put 15 in the divisible by 5's sequence, you can't put another instance of 15 in it. This goes even for sequences that naturally contain repeats. fibonacci only gets one 1, or a naturally repeating sequence like [1, 2, 1, 2, 1, 2, 1, 2] would be disallowed.
  
• The variables used in closed forms must represent integers (ℤ). For example you may not say that 5 is a member of the sequence n² because the square root of 5 is not an integer.
  
• Sequences that are the same or equivalent to a sequence that we already have, whether it is in active play or in the Finished category. For example if we already have the "divisible by two" sequence, we cannot also have the "even numbers" sequence. If we have "divisible by 3" then we cannot also have the "n = 0 mod 3" sequence. Once a sequence has been used it cannot be reused until we start a new game.

• Bingos are worth 8 points.
  
• Bingos must be neither too common nor overengineered. An attempt to clarify what this means follows:
  
• Your sequence should match less than or equal to half of the unique cards (55.5) in either the current deck or in the range [1,100], which may be less tedious to verify.
  
• Your sequence shouldn't have more than 2 working parts, for example "the number is
  prime
  mod 7
  " has two parts and is allowed. The
  digit sum
  of
  x²
  is
  less than 5
  and
  x³
  ends in a prime number
  has four parts and is not allowed.
  
• If you are a following a meta rule to generate rules for sequences, then the meta rule shouldn't be able to generate sequences that are bingos for more than 1/64th of hands.
  • An example meta rule that would generate a bingo all of the time is roots of the 7 degree polynomial (x - my first card)(x - my second card)(...)(x - my seventh card) = 0.
    
  • Another meta rule for generating sequences "look up my hand in a large database of sequences" is also not allowed for bingos, so you should be able to show enough of your work that we can see you worked forwards not backwards.)

• This post contains the order the players are in.
  
• If you see that it is your turn, you may go without waiting.
  
• If it has been your turn for 24 hours and you have not gone, I will prod you.
  
• If you don't go within 24 hours of being prodded we'll replace you, but you can stay if you post before I find someone new.
  
• While you're being replaced, to keep things moving, I'll play the leftmost card from your hand to the topmost sequence it can fit into, starting with your team's sequences, or pass if you don't have any such cards.
  
• Let us know if you're going to be V/LA.
  
• While V/LA, I'll nudge you if it's been 48 hours since you've gone and then at the 72 hour mark, I'll go for you, playing your leftmost hand to the topmost sequence it can fit into, starting with your own team's sequences, or passing otherwise.

• [13, 28, 43] {
  f(n) = 15n + 13
  } When you divide by 15, the remainder is 13
  
• [1, 2, 4, 16, 32, 64] {
  2ⁿ
  } The numbers you get by repeatedly doubling 1

• [3, 9, 27] {
  3ⁿ
  } The numbers you get by repeatedly tripling one.
  
• [8, 10, 13, 18, 39] {
  f(0) = 7, f(n) = f(n - 1) + g(n)
  ;
  g(0) = 1, g(1) = 1, g(n) = g(n - 1) + g(n - 2)
  } Each number starting with 7 has the the next number of the fibonacci sequence added to it
  
• [5, 93, 343] {
  n is a preperiodic point of a fixed point in the map f(n) = n² in ℤ₁₀₀
  } When you repeatedly square these numbers and take the remainder after dividing by 100, these numbers converge on a single point which remains itself when squared, but they are not themselves that final fixed point.
  
• [3, 21, 36, 51] {
  3n
  } these numbers can all be divided evenly by three.

• [14, 35, 343] {
  7n
  } divisible by 7

• [14, 35, 343] {
  7n
  } divisible by 7

• [15, 53, 91] {
  n = a₀10^d + a₁10^d-1 + ... + a_d10⁰ with a_i ≡ 1 (mod 2) ∀ i ∈ [1, 9], ∀ d > 1
  } numbers with at least two digits, all of which are odd

• [8, 18, 34] n is the sum of the Scrabble point values of the letters in the US spelling of the numbers in the deck.

• Your sequence should match less than or equal to half of the unique cards (55.5) in either the current deck or in the range [1,100], which may be less tedious to verify.
  
• If you are a following a meta rule to generate rules for sequences, then the meta rule shouldn't be able to generate sequences that are bingos for more than 1% of hands.
  • An example meta rule that would generate a bingo all of the time is roots of the 7 degree polynomial (x - my first card)(x - my second card)(...)(x - my seventh card) = 0.
    
  • Another meta rule for generating sequences "look up my hand in a large database of sequences" is also not allowed for bingos, so you should be able to show enough of your work that we can see you worked forwards not backwards.)

• [14, 35, 343] {
  7n
  } divisible by 7

• [15, 53, 91] {
  n = a₀10^d + a₁10^d-1 + ... + a_d10⁰ with a_i ≡ 1 (mod 2) ∀ i ∈ [1, 9], ∀ d > 1
  } numbers with at least two digits, all of which are odd

• [8, 18, 34] n is the sum of the Scrabble point values of the letters in the US spelling of the numbers in the deck.

• [4, 20, 36] {
  16n + 4
  } remainder is 4 when dividing by 16

In post 0, Plotinus wrote:

• On your turn, play some cards:
  • Either start a new sequence with
    at least 3 cards
    : "I'm playing 3, 9, 18 for divisible by 3." You are welcome to include a closed form if you can like { 3 | n } but you must translate this into English for the rest of the players.
    
  • Or steal somebody else's / continue one of your own: "I'm adding 4, and 16 to Plotinus' powers of 2"

• [14, 35, 343] {
  7n
  } divisible by 7

• [15, 53, 91] {
  n = a₀10^d + a₁10^d-1 + ... + a_d10⁰ with a_i ≡ 1 (mod 2) ∀ i ∈ [1, 9], ∀ d > 1
  } numbers with at least two digits, all of which are odd

• [8, 18, 34] n is the sum of the Scrabble point values of the letters in the US spelling of the numbers in the deck.

• [4, 20, 36] {
  16n + 4
  } remainder is 4 when dividing by 16

• [2, 4, 32] {
  2ⁿ
  } powers of two