codeninjasllc/codecombat
1
0
Fork 0
mirror of https://github.com/codeninjasllc/codecombat.git synced 2025-03-14 07:00:01 -04:00
Code Issues Projects Releases Packages Wiki Activity Actions

Note tournament end, undo tournament simulation bias

Browse source
This commit is contained in:
Nick Winter 2015-10-15 06:32:42 -07:00
parent 844bc942b3
commit e15b30893f
2 changed files with 12 additions and 11 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

21
app/templates/play/ladder/ladder.jade
View file

@ -101,8 +101,8 @@ block content
if level.get('name') == 'Ace of Coders'
.tournament-blurb
h2
span(data-i18n="ladder.tournament_ends") Tournament ends
//span(data-i18n="ladder.tournament_ended") Tournament ended
//span(data-i18n="ladder.tournament_ends") Tournament ends
span(data-i18n="ladder.tournament_ended") Tournament ended
| #{tournamentTimeLeft}
span(data-i18n="ladder.tournament_started") , started
| #{tournamentTimeElapsed}
@ -111,16 +111,17 @@ block content
|
a(href="http://blog.codecombat.com/ace-of-coders-multiplayer-programming-tournament", data-i18n="ladder.tournament_blurb_blog") on our blog
| .
//p
// strong Tournament ended!
p
strong Tournament ended!
// a(href="#winners") Behold the winners
// | . Thanks for playing! You can
// strong still play
// | Ace of Coders as long as you like.
//p
// | Want to commiserate? Head over to
// a(href="http://discourse.codecombat.com/") the forum
// | and discuss your strategies, your triumphs, and your turmoils.
| Thanks for playing! You can
strong still play
| Ace of Coders as long as you like.
p
| Want to commiserate? Head over to
a(href="http://discourse.codecombat.com/") the forum
| and discuss your strategies, your triumphs, and your turmoils.
div#columns.row
div.column.col-md-2

2
server/queues/scoring/getTwoGames.coffee
View file

@ -66,7 +66,7 @@ getRandomSessions = (user, callback) ->
# Sampling by level: we pick a level, then find a human and ogre session for that level, one at random, one biased towards recent submissions.
#ladderLevelIDs = ['greed', 'criss-cross', 'brawlwood', 'dungeon-arena', 'gold-rush', 'sky-span'] # Let's not give any extra simulations to old ladders.
ladderLevelIDs = ['dueling-grounds', 'cavern-survival', 'multiplayer-treasure-grove', 'harrowland', 'zero-sum', 'ace-of-coders', 'ace-of-coders', 'ace-of-coders', 'ace-of-coders']
ladderLevelIDs = ['dueling-grounds', 'cavern-survival', 'multiplayer-treasure-grove', 'harrowland', 'zero-sum', 'ace-of-coders']
sampleByLevel = (callback) ->
levelID = _.sample ladderLevelIDs
favorRecentHumans = Math.random() < 0.5 # We pick one session favoring recent submissions, then find another one uniformly to play against