我在这里使用了一些帖子来创建一个使用JavaScript和Jquery来显示括号的锦标赛支架系统。
我有16支球队以1-16领先。目前,我的分类种子如下:
[1,8],[4,5],[2,7],[3,6]
正如你所看到的,它在某种程度上有效,但半决赛将是1v4和2v3,这是不正确的。我希望半决赛是1v3和2v4,但无论我尝试什么,我似乎无法打印出来。所以它应该是:
[1,8],[3,6],[5,4],[7,2]
当你看到纸上的支架时,这也是如此,在1和2位于支架的两端的意义上是正确的,但无论我尝试什么,它都不起作用。
编辑:我也希望这能为更多的团队工作,所以16/32团队锦标赛,但是当我尝试使用这种算法时,我似乎根本没有正确的种子。这是我的代码:
var seeds = [ 1,2,3,4,5,6,7,8],
num_rounds = Math.log(seeds.length) / Math.log(2);
// 2-dimensional array
// Each subarray holds the seeds active in that round in order of matches played
// Example:
// seeds in first match of 2nd round are: bracket_round[1][0] & bracket_round[1][1]
var bracket_round = [];
// Create empty arrays inside bracket_round
for(var i = 0; i < num_rounds; i++) {
bracket_round[i] = [];
}
// Assuming no upsets
// Final is seed 1 and seed 2
bracket_round[num_rounds] = [ seeds[0], seeds[1] ];
// For each round in the bracket
for(var roundNum = num_rounds; roundNum > 0; roundNum--) {
var round = bracket_round[roundNum];
var prev_round = bracket_round[roundNum - 1];
// For each seed in the round, work out who they defeated in previous round, storing result
for(var m = 0; m < round.length; m++) {
// round.length = number of matches in the round
// number of teams in the round will be, number of matches * 2
var num_teams_in_round = round.length * 2;
// previous match team A = current match team "m"
prev_round[m * 2] = round[m];
// previous match team B = (# teams in previous round + 1) - (current match seed "m")
prev_round[(m * 2) + 1] = (num_teams_in_round + 1) - round[m];
}
}
document.write(bracket_round[1]);
var singleElimData = {
teams : [ // Matchups
[ bracket_round[1][0], bracket_round[1][1] ],
[ bracket_round[1][2], bracket_round[1][3] ],
[ bracket_round[1][4], bracket_round[1][5] ],
[ bracket_round[1][6], bracket_round[1][7] ]
],
results : [[
[ [1, 0], [1, 0], [1,0], [1, 0] ],
[ [1, 0], [1, 0] ],
[ [1, 0], [0, 1] ]
]
]
}
$(function() {
$('#singleElim').bracket({
init: singleElimData
})
})
1 = 0001 0001 = 1
2 = 0010 0011 = 3
3 = 0011 0010 = 2
4 = 0100 0110 = 6
5 = 0101 0111 = 7
6 = 0110 0101 = 5
7 = 0111 0100 = 4
8 = 1111 1000 = 8
答案 0 :(得分:0)
创建树时,您可以使用灰色代码来确定哪个边缘是播放器。基本上它正在反转位并添加1.在此处阅读:http://blade.nagaokaut.ac.jp/cgi-bin/scat.rb/ruby/ruby-talk/229068。