Doubles Minitour #2: Alphabet Cup [Round 1 @ #31]

Level 51

are graph theorists edgelords?
is a member of the Site Staffis an official Team Rateris a Forum Moderatoris a Community Contributoris a Tiering Contributoris a Contributor to Smogonis a Smogon Media Contributoris a Battle Server Moderatoris a Past Smogon Snake Draft Champion
Moderator
#1

Hi everyone! Following on from the success of the first friendly minitour, we're taking a deeper dive into oddball Doubles formats! For those unfamiliar with the concept of minitours, each minitour has a different twist placed on it, whether it's a different tier, some sort of teambuilding restriction, or something else entirely. All information for the current minitour can be found at the bottom of this post.

Tournament Rules:
  • This tournament will be Single Elimination
  • Rounds will be best of one.
  • Matches are to be played on Pokemon Showdown!
  • If you are found signing up under more than one alt, I'll be very sad! :(
  • Don't cheat! Why would you cheat? There's nothing at stake here!
  • Activity calls will be made by me. Coin flips will be done on PS!.
  • Don't be rude or disrespectful to your opponent!
  • Have fun!
Prizes:
  • The winner of the minitour will win a custom role in the DOU Discord, with a color of their choice. They may choose to override their pre-existing role colors with this color, if they like. The role will last until the next DOU minitour is won, though if minitours cease the role may be removed after an indeterminate amount of time.
====================================​

Minitour #2: Alphabet Cup
Minitour #1 added a ton of new things to play with, so this time we're taking them away! For Minitour #2, we'll be playing Alphabet Cup. Alphabet Cup follows the same banlists as standard DOU, but with one important change—you may not have two moves on your team starting with the same letter of the alphabet. For example, if you have Play Rough on your Azumarill, none of your six Pokemon (including Azumarill itself) may run Protect, since both moves start with the letter P. How will you prioritize your move selections?

Rules:
  • Standard DOU.
  • No two moves on your team may start with the same letter.
  • Z moves aren't affected by this clause, only base moves. For example:
    • Freeze Shock Kyurem-B @ Power Herb + Sacred Sword Kartana: Legal
    • Freeze Shock Kyurem-B @ Icium Z [giving Subzero Slammer] + Sacred Sword Kartana: Legal
    • Freeze Shock Kyurem-B @ Icium Z + Fake Out Incineroar: Illegal

====================================​

Signups list:
  1. Level 51
  2. Yuichii
  3. GenOne
  4. n1n1
  5. Yoda2798
  6. miltankmilk
  7. Mizuhime
  8. DaAwesomeDude1
  9. Arcticblast
  10. Yellow Paint
  11. talkingtree
  12. AtmosphereVGC
  13. marilli
  14. Demantoid
  15. Mishimono
  16. Nido-Rus
  17. Pigeons
  18. fespy
  19. Jrenner
  20. BlueSkiddo
  21. Mint16
  22. Ezrael
  23. Paraplegic
  24. n10sit
  25. Nails
  26. Qwello Lee
  27. Akumeoy
  28. Bughouse
To sign up, reply in this thread with "in" or with the first three sentences of the Wikipedia entry on the Boolean satisfiability problem. Signups close on 16 Nov at about 10am Eastern Time, so be sure to sign up soon!
 
Last edited:
#2
In computer science, the Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated as SATISFIABILITY or SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula. In other words, it asks whether the variables of a given Boolean formula can be consistently replaced by the values TRUE or FALSE in such a way that the formula evaluates to TRUE. If this is the case, the formula is called satisfiable.
 

DaAwesomeDude1

waiting for a moment
is a Tiering Contributor Alumnusis a Contributor Alumnus
#8
In computer science, the Boolean satisfiability problem (sometiMes called propositional satisfiability problem and abbreviated as SATISFIABILITY or SAT) is the problem of determining If there exists an interpretation that satisfies a given Boolean formula. In other words, it asks whether the variables of a given Boolean formula can be conSistently replaced by the values TRUE or FALSE in sucH a way that the formula evaluates to TRUE. If this is the case, the formula is called satisfiable.
 

marilli

ill do my best!
is a Forum Moderator Alumnusis a Community Contributor Alumnusis a Tiering Contributor Alumnusis a Contributor Alumnusis a defending SPL Champion
#12
In computer science, the Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated as SATISFIABILITY or SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula. In other words, it asks whether the variables of a given Boolean formula can be consistently replaced by the values TRUE or FALSE in such a way that the formula evaluates to TRUE. If this is the case, the formula is called satisfiable.
 

Level 51

are graph theorists edgelords?
is a member of the Site Staffis an official Team Rateris a Forum Moderatoris a Community Contributoris a Tiering Contributoris a Contributor to Smogonis a Smogon Media Contributoris a Battle Server Moderatoris a Past Smogon Snake Draft Champion
Moderator
#16
I recently added a rules section to the OP to make the rules clearer, including a section on Z moves as many of you have been asking about. In particular:

Z moves aren't affected by this clause, only base moves. For example:
  • Freeze Shock Kyurem-B @ Power Herb + Sacred Sword Kartana: Legal
  • Freeze Shock Kyurem-B @ Icium Z [giving Subzero Slammer] + Sacred Sword Kartana: Legal
  • Freeze Shock Kyurem-B @ Icium Z + Fake Out Incineroar: Illegal
Tagging everyone who's signed up so far so they see this:
Yuichii GenOne n1n1 Yoda2798 miltankmilk Mizuhime DaAwesomeDude1 Arcticblast Yellow Paint talkingtree AtmosphereVGC marilli Demantoid Mishimono Nido-Rus
 

Users Who Are Viewing This Thread (Users: 1, Guests: 0)

Top