Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>Using values is a good idea, but if you make them bit masks it's easier to check which players s have been matched. e.g. </p> <pre><code>player1.value = 1 player2.value = 2 player3.value = 4 //(dynamically player n would have value 1 &lt;&lt; (n-1) ) </code></pre> <p>By checking the mask with another player, it can be checked if they have been coupled already, since they already have their own mask value, they can never match themselves. As for the random factor, I think the easiest way is to create all combinations first, as you did in your example, and use an array of those combinations as the base of picking a random match. If you feel this approach is a good way to go, but have trouble implementing, I can try and cook up some example code.</p> <p><strong>Edit</strong> here's the example code, hope the comments help sort out their meaning <strong>Edit2</strong> changed team combinations</p> <pre><code> var playercount = 5; //add players var players = new Array(); for (var i = 0; i &lt; playercount; i++) { players[i] = { Index: i, Mask: 1 &lt;&lt; i, Name: "Player" + (i + 1), toString: function () { return this.Name; } }; //about the 1 &lt;&lt; i: "&lt;&lt;" is a so called bit wise shift to the left. //1 &lt;&lt; i has the same outcome as 2 to the power of i } //the line below would print all players //for (var pi in players) { var p = players[pi]; document.write(p + " (Mask:" + p.Mask + ")&lt;br&gt;"); } document.writeln("&lt;br&gt;"); //create all possible team combinations var teams = new Array(); var playersPerTeam = Math.floor(playercount / 2); function Team(){ this.list = new Array(); this.mask = 0; this.count = 0; this.full =false; this.Add = function (i) { this.list.push(players[i]); this.mask |= players[i].Mask; this.full = ++this.count === playersPerTeam; } this.toString = function () { var res = "", cnt = this.list.length; for (var i = 0; i &lt; cnt; i++) { if (i &gt; 0) res += i == cnt - 1 ? " and " : ","; res += this.list[i].Name; } return res; } } function addplayers() { var indices = new Array(playersPerTeam); for (var p = 0; p &lt; playersPerTeam; p++) indices[p] = p; var l = playersPerTeam - 1; function addteam() { var team = new Team(); for (var p = 0; p &lt; playersPerTeam; p++) team.Add(indices[p]); teams.push(team); } function addplayer(start, depth) { var target = players.length - playersPerTeam + depth + 1; var team; for (var i = start; i &lt; target; i++) { indices[depth] = i; if (depth == l) addteam(); else addplayer(i + 1, depth + 1); } } addplayer(0, 0); } addplayers(); //the line below would print the team combinations //for (var te in teams) { var t = teams[te]; document.write(t + " (mask:" + t.mask + ")&lt;br&gt;"); } document.writeln("&lt;br&gt;"); //create matches var matches = new Array(); //the matches can be created in the same way as the teams, only the first team cannot have players of the second team for (var i = 0; i &lt; teams.length; i++) { for (var j = i + 1; j &lt; teams.length; j++) { var t1 = teams[i], t2 = teams[j]; if ((t1.mask &amp; t2.mask) === 0) //this is where the masks come in, matches.push({ Team1: t1, Team2: t2, toString: function () { return this.Team1 + " versus " + this.Team2 } }); } } //randomize matches. Instead of picking a random match per turn, we can randomize at the //start, so we know all the matches in advance. //this can be done by using a sort on the array with a random index //NB, this isn't the most random randomness (or whatever you call it LOL). For better shuffling //there are several alternatives, but perhaps this one is enough matches.sort(function() { return (parseInt(Math.random() * 100) % 2);}); //the line below prints the matches for (var mi in matches) { document.write(matches[mi] + "&lt;br&gt;"); } document.writeln("&lt;br&gt;"); </code></pre>
    singulars
    1. This table or related slice is empty.
    1. POHow to divide x number of players into 2 teams randomly multiple times, differently every time?
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USMe.Name
    1. USMe.Name
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POHow to divide x number of players into 2 teams randomly multiple times, differently every time?
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTAcceptedByOriginator
    1. COsounds good – creating all combinations and then picking randomly – but understood nothing of 'bit mask' nor "1 << (n-1)". Some example code would be great!
      singulars
      1. PO
      1. USmicadelli
    2. COSorry for the late response, I've been out for coffee and dinner :) I've added the sample to the post above
      singulars
      1. PO
      1. USMe.Name
    3. COgreat stuff! Tried to run this and it works although i still don't got those "mask: players[i].Mask | players[j].Mask" and "if ((t1.mask & t2.mask) === 0)"... but I will. However, I don't know if it was due to my bad english but this divides players into a team of 2 players, and I only wanted to divide all the players into 2 separate teams. So, 9 players will be divided 5 vs 4. How the code should be changed.
      singulars
      1. PO
      1. USmicadelli
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload