DO: // Copmlete the randBool function // Complete the decideWinner function // Takes no inputs // Returns a boolean by random // Will use Math.random() to simulate randomness function randBool(){ return ; } // Decides winner between two players // Takes two players as input (strings) // returns one of the inputs by random (as winner) // Will use randBool function above function decideWinner(player1, player2){ return; } // ---------------- STOP ---------------- // Do not make any edits in this section // -------------------------------------- const uni = ["Illinois", "Indiana", "Iowa", "Maryland", "Michigan", "Minnesota", "Nebraska", "Wisconsin"]; function competeClick(){ // if tier2 is empty const tier1 = document.getElementsByClassName("tier1"); const tier2 = document.getElementsByClassName("tier2"); const tier3 = document.getElementsByClassName("tier3"); const tier4 = document.getElementsByClassName("tier4"); if (!tier2[0].value){ for (let i = 0; i < 4; ++i){ const p1 = tier1[i*2].value; const p2 = tier1[i*2 + 1].value; tier2[i].value = decideWinner(p1, p2); // const p1 = document.getElementById("tier1_" + String(i*2)).value; // const p2 = document.getElementById("tier1_" + String(i*2 + 1)).value; // document.getElementById("tier2_" + String(i)).value = decideWinner(p1, p2); } } // if tier3 is empty else if (!tier3[0].value){ for (let i = 0; i < 2; ++i){ const p1 = tier2[i*2].value; const p2 = tier2[i*2 + 1].value; tier3[i].value = decideWinner(p1, p2); // const p1 = document.getElementById("tier2_" + String(i*2)).value; // const p2 = document.getElementById("tier2_" + String(i*2 + 1)).value; // document.getElementById("tier3_" + String(i)).value = decideWinner(p1, p2); } } // if tier4 is empty else if (!tier4[0].value){ const p1 = tier3[0].value; const p2 = tier3[1].value; tier4[0].value = decideWinner(p1, p2); // const p1 = document.getElementById("tier3_0").value; // const p2 = document.getElementById("tier3_1").value; // document.getElementById("tier4_0").value = decideWinner(p1, p2); } else{ // all filled return; } } function clearClick(){ // set all to "" const tier2 = document.getElementsByClassName("tier2"); const tier3 = document.getElementsByClassName("tier3"); const tier4 = document.getElementsByClassName("tier4"); for (let i = 0; i < 4; ++i){ tier2[i].value = ""; } for (let i = 0; i < 2; ++i){ tier3[i].value = ""; } tier4[0].value = ""; } // Init const tier1 = document.getElementsByClassName("tier1"); for (let i = 0; i < 8; ++i){ // populate initial uni names tier1[i].value = uni[i]; }
// TO DO:
// Copmlete the randBool function
// Complete the decideWinner function
// Takes no inputs
// Returns a boolean by random
// Will use Math.random() to simulate randomness
function randBool(){
return ;
}
// Decides winner between two players
// Takes two players as input (strings)
// returns one of the inputs by random (as winner)
// Will use randBool function above
function decideWinner(player1, player2){
return;
}
// ---------------- STOP ----------------
// Do not make any edits in this section
// --------------------------------------
const uni = ["Illinois", "Indiana", "Iowa", "Maryland", "Michigan", "Minnesota", "Nebraska", "Wisconsin"];
function competeClick(){
// if tier2 is empty
const tier1 = document.getElementsByClassName("tier1");
const tier2 = document.getElementsByClassName("tier2");
const tier3 = document.getElementsByClassName("tier3");
const tier4 = document.getElementsByClassName("tier4");
if (!tier2[0].value){
for (let i = 0; i < 4; ++i){
const p1 = tier1[i*2].value;
const p2 = tier1[i*2 + 1].value;
tier2[i].value = decideWinner(p1, p2);
// const p1 = document.getElementById("tier1_" + String(i*2)).value;
// const p2 = document.getElementById("tier1_" + String(i*2 + 1)).value;
// document.getElementById("tier2_" + String(i)).value = decideWinner(p1, p2);
}
}
// if tier3 is empty
else if (!tier3[0].value){
for (let i = 0; i < 2; ++i){
const p1 = tier2[i*2].value;
const p2 = tier2[i*2 + 1].value;
tier3[i].value = decideWinner(p1, p2);
// const p1 = document.getElementById("tier2_" + String(i*2)).value;
// const p2 = document.getElementById("tier2_" + String(i*2 + 1)).value;
// document.getElementById("tier3_" + String(i)).value = decideWinner(p1, p2);
}
}
// if tier4 is empty
else if (!tier4[0].value){
const p1 = tier3[0].value;
const p2 = tier3[1].value;
tier4[0].value = decideWinner(p1, p2);
// const p1 = document.getElementById("tier3_0").value;
// const p2 = document.getElementById("tier3_1").value;
// document.getElementById("tier4_0").value = decideWinner(p1, p2);
}
else{
// all filled
return;
}
}
function clearClick(){
// set all to ""
const tier2 = document.getElementsByClassName("tier2");
const tier3 = document.getElementsByClassName("tier3");
const tier4 = document.getElementsByClassName("tier4");
for (let i = 0; i < 4; ++i){
tier2[i].value = "";
}
for (let i = 0; i < 2; ++i){
tier3[i].value = "";
}
tier4[0].value = "";
}
// Init
const tier1 = document.getElementsByClassName("tier1");
for (let i = 0; i < 8; ++i){
// populate initial uni names
tier1[i].value = uni[i];
}
![](/static/compass_v2/shared-icons/check-mark.png)
Step by step
Solved in 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)