​

NSCI 237

Application of Learning

​

Ibrahim Noon, 2021

​

A Monopoly simulation that outputs each space with its respective visit count. This program has no association with the Monopoly board game or its manufacturer.

​

*/

​

let numOfTurns = 1000;

​

let dice = {

  first: 0,

  second: 0,

  choices: [1, 2, 3, 4, 5, 6],

  rolled: 0

}

​

let counter = 0;

let tokenPos = {

  p1: 0,

}

​

// array.push(array.splice(index, 1)[0]); | push an element to the bottom

// shuffle(arr, true); | shuffle array

​

let table;

​

function preload() {

  table = loadTable('boardIndex.csv', 'csv', 'header');

}

​

function setup() {

  shuffle(chance, true);

  shuffle(communityChest, true);

​

  for (let i = 0; i < numOfTurns; i++) {

    roll(tokenPos.p1);

    if (dice.first == dice.second) { // first double

      roll(tokenPos.p1);

      numOfTurns -= 1;

​

      if (dice.first == dice.second) { // second double

        counter = 10;

        boardCounter(10);

        numOfTurns -= 1;

      }

    }

  }

​

  for (let c = 0; c < 40; c++) {

    console.log(table.get(c, "Title") + ": " + table.get(c, "Count"))

  }

​

  saveTable(table, "Monopoly_" + str(1000) +".txt");

}

​

function roll(token) {

  dice.first = random(dice.choices);

  dice.second = random(dice.choices);

  dice.rolled = dice.first + dice.second;

  counter += dice.rolled;

  move(token);

​

  //   if (dice.first == dice.second) { // first double

  //     dice.first = random(dice.choices);

  //     dice.second = random(dice.choices);

  //     dice.rolled = dice.first + dice.second;

  //     counter += dice.rolled;

  //     move(token);

​

  //     if (dice.first == dice.second) { // second double

  //       token = 10;

  //       boardCounter(token);

  //     }

  //   }

}

​

function move(position) {

  let index = counter % 40;

  position = (position + index) % 40;

​

  switch (position) {

    case 2:

      position = pickUpCard(communityChest, position);

      boardCounter(2);

      break;

    case 17:

      position = pickUpCard(communityChest, position);

      boardCounter(17);

      break;

    case 33:

      position = pickUpCard(communityChest, position);

      boardCounter(33);

      break;

    case 7:

      position = pickUpCard(chance, position);

      boardCounter(7);

      break;

    case 22:

      position = pickUpCard(chance, position);

      boardCounter(22);

      break;

    case 36:

      position = pickUpCard(chance, position);

      boardCounter(36);

      break;

    case 30:

      position = 10;

      boardCounter(30);

      boardCounter(position);

      break;

    default:

      boardCounter(position);

  }

}

​

function boardCounter(position) {

  let spaceCount = table.getNum(position, "Count");

  table.set(position, "Count", spaceCount + 1);

}

​

function pickUpCard(array, position) {

  let pos = position;

​

  switch (array[0]) {

    case "Adv to Boardwalk":

      pos = 39;

      boardCounter(pos);

      break;

    case "Adv to Go":

      pos = 0;

      boardCounter(pos);

      break;

    case "Adv to Illinois Ave.":

      pos = 24;

      boardCounter(pos);

      break;

    case "Adv to St. Charles Place":

      pos = 11;

      boardCounter(pos);

      break;

    case "Adv to the nearest RR":

      if (position < 5 || position > 35) {

        pos = 5;

      } else if (position < 15) {

        pos = 15;

      } else if (position < 25) {

        pos = 25;

      } else {

        pos = 35;

      }

      boardCounter(pos);

      break;

    case "Adv to the nearest Utility":

      if (position < 12 || position > 28) {

        pos = 12;

      } else {

        pos = 28;

      }

      boardCounter(pos);

      break;

    case "Go Back 3 Spaces":

      pos = position - 3;

      boardCounter(pos);

      break;

    case "Go to Jail":

      pos = 10;

      boardCounter(pos);

      break;

    case "Take a ride on Reading":

      pos = 5;

      boardCounter(pos);

      break;

  }

​

  array.push(array.splice(0, 1)[0]);

  return pos;

}