Borne from an academic curiosity to find out the best booming civ to produce a pure 200 villager boom, we decided to open this contest to any AOE II player, with a minimum of 100 games played, and no ELO minimum
This challenge is part of the Age of Challenges series, which aim to dive deeper into the game and highlight nuances of specific gameplay through a series of challenges using a tournament format
RULES
- Map: Custom Arena made by @c3mbre
- Visibility: All visible
- Team: All random team
- Civilization: Free pick any civ (except China/Incas), hidden civ
- Banned civs: Chinese, Incas
- No pauses allowed
- No laming of any resources
- No attempts to sabotage other players
Administrators will review each replay to calculate the winners of each round. The first players to reach 200 villagers will advance to the next round
REGISTRATION
Please sign up using our official Discord server (Rage of Empires): https://discord.gg/7mmrgKxGo to the channel named #race-to-200-vills-signups and enter the following information:
Player tag: Jimmy2Timez
AOE2.net URL: https://aoe2.net/#profile-277709
TOURNAMENT STRUCTURE
Depending on the number of sign ups, we will have a 32 player or 64 player bracket. The top 16 players will be placed in the corners of the bracket so as to not face each other in the first round
32 players:
Round 1 - 4 games x 8 players (top 2 players from each game advance)
Final - 8 players (winner takes all)
64 players:
Round 1 - 8 games x 8 players (top 2 players from each game advance)
Round 2 - 2 games x 16 players (top 4 players from both games advance)
Final - 8 players (winner takes all)
TIMELINE
Wednesday, Nov 3 - Sign ups open
Monday, Nov 8 - Sign ups close @ midnight GMT
Tuesday, Nov 9 - Tournament starts at 18 GMT. Each round is 45 minutes. Final will be held at 19:30 GMT
STREAMING
This event will be live cast on Twitch: https://www.twitch.tv/villiams
We encourage any and all streamers to cast this event. Please make sure to credit Villiams as host and Jimmy2Timez as the tournament sponsor
Last edited: