28:null 29:["$","title",null,{"children":"Event assignment | Olli-Pekka Tikkanen | Observable"}] 2e:T975,function runPADGMultipleTimes(LL,evnts,grps,updateFun) { let arrangement = PADGopt(L,evnts,grps,grps,updateFun) let happiness = totalHappiness(arrangement,groups)/groups.length let grp = grps.slice() let numOptRounds = 0 for(let round = 1; round < numOptRounds; round++) { //find groups that were not set to any event let groupsNotAssigned = arrangement.filter(ele => ele.assignment === -1) let newGroups = [] for(let g in groupsNotAssigned){ newGroups.push(groups.filter(ele => ele.name === groupsNotAssigned[g].name)[0]) } //update new events so that the groups already assigned to them are included let newEvents = evnts.map(ele => { return { name: ele.name, min: ele.min, max: ele.max, } }) newEvents.playerCount = (eventName) => { // function to count how many players are already assigned to an event let e = newEvents.findIndex(ele => { return ele.name === eventName }) if(typeof(newEvents[e].groups) !== 'undefined' && newEvents[e].groups.length > 0) { return newEvents[e].groups.reduce((a, b) => { return a+grp.filter(g=>g.name === b)[0].size }, 0); } else { return 0 } } for(let e in newEvents) { let playersInThisEvent = arrangement.filter(ele=>ele.assignment === Number(e)) .map(ele => ele.name) if(playersInThisEvent.length>0) { newEvents[e].groups = playersInThisEvent } } //console.log(newEvents) //construct new L which includes only gain from assigning groups in newGroups let newL = [] for(let i=0;i a.gain - b.gain) //console.log(newEvents) let newArrangement = PADGopt(newL,newEvents,newGroups,grps,updateFun) newArrangement.map(ele => { if(ele.assignment !== -1) { let arrInd = arrangement.findIndex(arrEle => arrEle.name === ele.name) arrangement[arrInd].assignment = ele.assignment } }) } return arrangement }2f:T1c80,PADGopt = (Lis,evnt,grp,grpAll,updateFun) => { let LL = JSON.parse(JSON.stringify(Lis)) let evn = JSON.parse(JSON.stringify(evnt)) let M = grp.map(e => { return {name: e.name,assignment: -1} }) let S = evn.map(ele => { return { name: ele.name, min: ele.min, max: ele.max, groups: ele.hasOwnProperty('groups') ? ele.groups : [] } }) // function definitions for S if(typeof(S.playerCount) === 'undefined') { S.playerCount = (e) => { // function to count how many players are already assigned to an event if(S[e].groups.length > 0) { return S[e].groups.reduce((a, b) => { return a+grpAll.filter(g=>g.name === b)[0].size }, 0); } else { return 0 } } } let P = [] // Phantom events // function definitions for P P.createEntry = (newEntry) => { //function to create a new entry to S P.push({name: newEntry.name, min: newEntry.min, max: newEntry.max, }) } P.removeEntry = (eventName) => { let ind = P.findIndex(ele => ele.name === eventName) P.splice(ind,1) } P.includes = (eventName) => { //check if event named eventName is in P if(P.filter(ele => ele.name === eventName).length === 1) { return 1 } else { return 0 } } //define deficit let deficit = 0 //initialize V to be the same as groups let V = grp.slice() //MAIN LOOP STARTS HERE LL = LL.filter(ele => ele.gain > 0) while(LL.length>0) { let u = LL.pop() // u is the last index of LL // check if there are enough people signed up for this game // in order to avoid matching some group with this event // without hope of this event ever happening let numPlayersToThisEvent = 0 grp.filter(ele => { return typeof(ele.pref.find(p => p===u.event)) !== 'undefined'}) .forEach(ele => { numPlayersToThisEvent = numPlayersToThisEvent + ele.size }) if(u.gain === 0 || numPlayersToThisEvent < evnt[u.event].min) { // consider only cases where adding u to event increases happiness // and those where there is even theoretically possible to have // minimum number of players continue } let Mind = M.findIndex(g => g.name === u.name) if(M[Mind].assignment === -1 && (S.playerCount(u.event) + u.size) <= S[u.event].max) { // user u is not assigned and there is space in the event where we try to place u //console.log('before') //console.log(S.playerCount(u.event)) let playersBefore = S.playerCount(u.event) if(S.playerCount(u.event) === 0) { //no players in S or S is not yet a real event if( deficit + (evnt[u.event].min - u.size) < V.length) { // adding u to this event does not decrease deficit over critical size // since event is not in S add it to P // add to deficit how much space was left over in this event deficit = deficit + (evnt[u.event].min - u.size) if(P.includes(S[u.event].name) === 0) { let newPEntry = { name: evnt[u.event].name, min: evnt[u.event].min, max: evnt[u.event].max, } P.createEntry(newPEntry) } } else { continue } } else { // S has players and is happening anyway if(P.includes(evnt[u.event].name) === 1) { deficit = deficit - u.size } } S[u.event].groups.push(u.name) V = V.filter(ele => ele.name !== u.name) if(S.playerCount(u.event) >= S[u.event].min && P.includes(S[u.event].name) === 0) { // this event is not a phantom event, set M(u) to a M[Mind].assignment = u.event // remove u from other events S.forEach(ele => { if(ele.name !== S[u.event].name) { let nPlayersBefore = S.playerCount(S.findIndex(s=>s.name === ele.name)) ele.groups = ele.groups.filter(e => e !== u.name) // check that there are enough players in this event let nPlayersAfter = S.playerCount(S.findIndex(s=>s.name === ele.name)) //if nPlayers < ele.min add this event as a phantom event if(nPlayersAfter < nPlayersBefore && nPlayersAfter < ele.min) { if(P.inclues(ele.name) === 0) { P.createEntry({ name: ele.name, min: ele.min, max: ele.max }) } // remove assignment ele.groups.forEach(e => { let MindTemp = M.findIndex(m => m.name === e) if(M[MindTemp].assignment === S.findIndex(s=>s.name === ele.name)) { M[MindTemp].assignment = -1; } }) } } }) } if(S.playerCount(u.event) >= S[u.event].min && P.includes(S[u.event].name) === 1) { // this event is a phantom event but has now enough players to be a real event //console.log(u.event) P.removeEntry(S[u.event].name) // remove this event from phantom events S[u.event].groups.forEach(el => { let MindTemp = M.findIndex(m => m.name === el) M[MindTemp].assignment = u.event }) for(let g in S[u.event].groups) { S.forEach(ele => { if(ele.name !== S[u.event].name) { let nPlayersBefore = S.playerCount(S.findIndex(s=>s.name === ele.name)) ele.groups = ele.groups.filter(e => e !== S[u.event].groups[g]) // check that there are enough players in this event let nPlayersAfter = S.playerCount(S.findIndex(s=>s.name === ele.name)) //if nPlayers < ele.min add this event as a phantom event if(nPlayersAfter < nPlayersBefore && nPlayersAfter < ele.min) { if(P.includes(ele.name) === 0) { P.createEntry({ name: ele.name, min: ele.min, max: ele.max }) } // remove assignment if there is assignment to this event that is now phantom event ele.groups.forEach(e => { let MindTemp = M.findIndex(m => m.name === e) if(M[MindTemp].assignment === S.findIndex(s=>s.name === ele.name)) { M[MindTemp].assignment = -1; } }) } } }) } } //Update list LL if there was no assignment if(M[Mind].assignment === -1) { let gInd = grp.findIndex(g => g.name === u.name) LL = updateFun(LL,grp,gInd) } } } return M }30:Tc51,randomOpt = (evnt,grp) => { let allEvents = evnt.slice().map(ele => { return {...ele, groups: []}}) allEvents.playerCount = (eventName) => { // function to count how many players are already assigned to an event let e = allEvents.findIndex(ele => { return ele.name === eventName }) if(allEvents[e].groups.length > 0) { return allEvents[e].groups.reduce((a, b) => { return a+grp.filter(g=>g.name === b)[0].size }, 0); } else { return 0 } } //shuffle events in a different list. This list is iterated in the loop let shuffledEvents = evnt.slice() .sort((a,b)=>Math.random()-0.5) //array containing person names and their arrangements let M = grp.map(e => { return {name: e.name,assignment: -1} }) let V = grp.slice() while(shuffledEvents.length>0) { //next random event let randomEvent = shuffledEvents.pop() // index of u in evnt so that it can be compared to preferences let eInd = allEvents.findIndex(ele => ele.name === randomEvent.name) // check if there are enough people signed up for this game // in order to avoid matching some group with this event // without hope of this event ever happening let numPlayersToThisEvent = 0 grp.filter(ele => { return typeof(ele.pref.find(p => p===eInd)) !== 'undefined'}) .forEach(ele => { numPlayersToThisEvent = numPlayersToThisEvent + ele.size }) if(numPlayersToThisEvent < allEvents[eInd].min) { //the event is not happening anyway, do not assign players to this event continue } //find a random group that wants to go to this event let randomGroupToThisEvent = V.filter(ele => { return typeof(ele.pref.find(p => p===eInd)) !== 'undefined' }).sort((a,b)=>Math.random()-0.5).slice(0,1) let timesTried = 0 while(timesTried < 10) { if(randomGroupToThisEvent.length===0) { //no team found, increase timesTried and continue timesTried = timesTried +1 continue } if(allEvents.playerCount(randomEvent.name)+randomGroupToThisEvent[0].size<=allEvents[eInd].max) { //There is room to assign this group to this event. Do it allEvents[eInd].groups.push(randomGroupToThisEvent[0].name) timesTried = 1 } else { timesTried = timesTried+1 continue } if(allEvents.playerCount(randomEvent.name)>=allEvents[eInd].min) { //This event has minimum number of players and is happening //set assignments for every group in this event allEvents[eInd].groups.forEach(ele => { let Mind = M.findIndex(m => m.name === ele) M[Mind].assignment = eInd }) } //remove this group from V so they will not be placed again V = V.filter(ele => ele.name !== randomGroupToThisEvent[0].name) randomGroupToThisEvent = V.filter(ele => { return typeof(ele.pref.find(p => p===eInd)) !== 'undefined' }) .sort((a,b)=>Math.random()-0.5).slice(0,1) } } return M }31:T456,checkArrangement = (arr,grp,evnts) => { //checks if the arrangement is a valid one (ie. no event has less than minimum and no more than maximum number of //attendees // OUTPUT // 1 = arr is valid // 0 = arr is not valid let arrToUse = JSON.parse(JSON.stringify(arr)); let valid = 1; evnts.forEach(e => { let eInd = evnts.findIndex(ee => ee.name === e.name) // Should have just used a for loop... let numPlayers = 0 let groupsAttending = arrToUse.filter(a => a.assignment === eInd) if(groupsAttending.length >0) { groupsAttending = groupsAttending.map(gr => { let groupdata = grp.find(g => { return g.name === gr.name }) return {... gr, size: groupdata.size} }) numPlayers = groupsAttending.reduce((total,gr) => { return total + gr.size },0) if(numPlayers < e.min){ console.log('min') console.log(e) valid = 0 } if(numPlayers > e.max) { console.log('max') console.log(e) valid = 0 } } }) return valid } 32:T71a,groups = names.map(nimi => { let groupSize = randInt(1,maxRyhma,1) //This is to set 66% of the groups to of size one if(Math.random() > (1-percentGroupsizeIsOne)) { groupSize = 1 } //console.log(groupSize) let p = [] let stopCond = 0 let possibleEvents = events.filter(ele => ele.max >= groupSize) //console.log(possibleEvents.length) //console.log(numHalukkuus) if(possibleEvents.length === 0) { p = [] // empty array } else if(possibleEvents.length === 1) { p = events.findIndex(ele => ele.name === possibleEvents.name) } else if(possibleEvents.length < numHalukkuus) { //choose how many events the group wants to go let numToGo = randInt(1,possibleEvents.length,1) //Sort array of possible events randomly and choose the correct index let randomEvents = possibleEvents.sort((a,b)=>0.5-Math.random()) .slice(0,numToGo) //push randomEvents as indexex to p randomEvents.forEach(ele => { p.push(events.findIndex(e=>e.name===ele.name)) }) } else { // there is at least numHalukkuus places, draw integers randomly let numToGo = randInt(1,numHalukkuus,1) let randomEvents = possibleEvents.sort((a,b)=>0.5-Math.random()) .slice(0,numToGo) //push randomEvents as indexex to p randomEvents.forEach(ele => { p.push(events.findIndex(e=>e.name===ele.name)) }) } //This is to check that everything went well in the preference assignment //i.e. no group wants to go to an event whose max number of players is smaller than // the group's size p.forEach(ele => { //console.log(events[ele]) //console.log(groupSize) if(events[ele].max < groupSize) { stopCond = 0 } }) return { name: nimi, pref: p, size: groupSize } }) 33:[] 2c:{"id":"a94651ff4bb1a056","slug":"event-assignment","title":"Event assignment","thumbnail":"5f4b8197eda8de330dc7f775c84ecd7a6b46462477c0a01e0ff86c7f4901977e","access_level":"public","create_time":"$D2019-01-23T08:44:24.686Z","update_time":"$D2019-04-28T11:03:25.240Z","view_time":null,"first_public_time":"$D2019-03-07T19:57:48.409Z","has_unpublished_edits":null,"fork":false,"stars":0,"starred":false,"owner":{"type":"team","id":"0e969331bf0cf663","login":"altesmi","name":"Olli-Pekka Tikkanen","avatar_url":"https://avatars-next.observableusercontent.com/491bf5e3cb987f7295ae9d7e9f0ee79b8bc8183b6ef6f8a2188ab82ed5111e4d","tier":"starter_2024"},"version":1285,"publish_version":1285,"role":null,"authored":false,"authors":[{"type":"individual","id":"749fee2f48c09e42","login":"altesmi","name":"Olli-Pekka Tikkanen","avatar_url":"https://avatars-next.observableusercontent.com/491bf5e3cb987f7295ae9d7e9f0ee79b8bc8183b6ef6f8a2188ab82ed5111e4d","tier":null}],"members":[{"type":"individual","id":"749fee2f48c09e42","login":"altesmi","name":"Olli-Pekka Tikkanen","avatar_url":"https://avatars-next.observableusercontent.com/491bf5e3cb987f7295ae9d7e9f0ee79b8bc8183b6ef6f8a2188ab82ed5111e4d","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"lapsed":null,"subscribed":null,"forks":1,"collection":null,"type":"notebook","body":{"title":"Event assignment","cells":[{"id":0,"value":"md`# Event assignment`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":115,"value":"md `## Input optimointiin`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":10,"value":"md`Määritä osallistuvien optimoinnissa käytettävät parametrit. Ryhmien koko arvotaan satunnaisesti ykkösen ja asetetun arvon välillä. Vähintään asetettu prosenttiosuuden verran ryhmistä saa koon '1'. Tapahtumat joihin ryhmä haluaa mennä ja niiden lukumäärä arvotaan satunnaisesti ykkösen ja asetetun arvon väliltä.`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":28,"value":"viewof numOsallistujat = slider({\n min: 1,\n max: 300,\n step: 1,\n title: \"👧 Osallistuvien ryhmien lukumäärä\",\n value: 50\n})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":38,"value":"viewof maxRyhma = slider({\n min: 1,\n max: 6,\n step: 1,\n title: \"👧‍👦👧‍ Ryhmän maksimikoko\",\n value: 5\n})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":572,"value":"viewof percentGroupsizeIsOne = slider({\n min: 0, \n max: 1, \n step: 0.01, \n format: \".0%\",\n title: 'Kuinka monta prosenttia ryhmistä asetetaan yhden henkilön kokoisiksi pakosti'\n})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":34,"value":"viewof numTapahtumat = slider({\n min: 5,\n max: 100,\n step: 1,\n title: \"🎲 Tapahtumien lukumäärä\",\n value: 30\n})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":49,"value":"viewof minTapahtuma = slider({\n min: 1,\n max: 4,\n step: 1,\n title: \"Tapahtumien miniosallistujamäärä\",\n value:2\n});","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":53,"value":"viewof maxTapahtuma = slider({\n min: 2,\n max: 7,\n step: 1,\n title: \"Tapahtumien maksimiosallistuajmäärä\",\n value: 6,\n});","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":55,"value":"viewof numHalukkuus = slider({\n min: 1,\n max: 5,\n step: 1,\n title: \"Kuinka monta tapahtumaa osallistuja voi valita\"\n})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1127,"value":"md `**Kuinka paljon painotetaan halukkuuksia ja kuinka paljon ryhmia (1=painotetaan vain halukkuuksia, 0=painotetaan vain että ryhmä pääsee johonkin tapahtumaan)**`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1131,"value":"viewof alpha = slider({\n min: 0.1,\n max: 1,\n step: 0.01,\n title: \"Alpha\"\n})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":601,"value":"`${events.reduce((tot,ele)=> ele.max+tot,0)} paikkaa peliin ${groups.reduce((tot,ele)=>ele.size+tot,0)} pelaajalle`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":119,"value":"md `## Optimoinnnin tulokset`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":591,"value":"md `### PADG`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":480,"value":"md `Kokonaisonnellisuus (jos jokainen asetetaan omaan ykkösvalintaansa onnellisuus on 100%)`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":489,"value":"`${Math.round(totalHappiness(arrangement,groups)/numOsallistujat * 10000)/100}%`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":594,"value":"md `${arrangement.filter(ele => ele.assignment===-1).length} (${Math.round(arrangement.filter(ele => ele.assignment===-1).length/numOsallistujat*10000)/100}%) ryhmää jäi ilman paikkaa`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":588,"value":"md `### Random matching`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":743,"value":"md `Kokonaisonnellisuus`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":748,"value":"`${Math.round(totalHappiness(randomArrangement,groups)/numOsallistujat * 10000)/100}%`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":752,"value":"md `${randomArrangement.filter(ele => ele.assignment===-1).length} (${Math.round(randomArrangement.filter(ele => ele.assignment===-1).length/numOsallistujat*10000)/100}%) ryhmää jäi ilman paikkaa`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":758,"value":"md `### menetelmien vertailu`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":760,"value":"`PADG on ${Math.round((totalHappiness(arrangement,groups)/totalHappiness(randomArrangement,groups)-1)*10000)/100} % parempi (negativinen luku tarkoittaa huonompaa)`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":111,"value":"md `## Optimointialgoritmit`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":277,"value":"md `Optimoinnin tavoitteena on maksimoida listassa ***L*** oleva tyytyväisyys`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":865,"value":"arrangement = runPADGMultipleTimes(L,events,groups,updateL)","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":364,"value":"$2e","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":522,"value":"md `PADGopt (phantom aware dynamic greedy) on algoritmi, joka yrittää asettaa listasta L aina sen elementin joka tuottaisi maksimimäärän onnellisuutta. Siinä on kuitenkin erillinen deficit-termi, joka estää suuren määrän haamueventtien luomisen. Haamueventti on eventti johon jokin ryhmä tai jotkin ryhmät haluaisivat, mutta heidän yhteenlaskettu määrä ei riitä saamaan eventtiä tapahtumaan`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":282,"value":"$2f","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1121,"value":"updateL(L,groups,3)","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1120,"value":"updateL = (LL,grp,gInd) => {\n /*Updates the list LL so that gain increases as possibilities for \n assignment decrease */\n LL.forEach(ele => {\n \n if(ele.name===grp[gInd].name ) {\n //calculate the number of preferences\n let numPref = grp[gInd].pref.length\n\n let numPossibilities = LL.filter(g=>g.gain > 0).filter(g => g.name ===ele.name).length\n if(numPossibilities < numPref && numPossibilities > 1) {\n ele.gain = ele.gain + (1.0-alpha)/(numPossibilities-1)*(numPref-numPossibilities)/(numHalukkuus-1)\n }\n }\n })\n \n return LL.sort((a,b) => a.gain-b.gain)\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":634,"value":"randomArrangement = { \n let randomArrangement = randomOpt(events,groups)\n let randomhappiness = totalHappiness(randomArrangement,groups)/numOsallistujat\n let newRandomArrangement = []\n let newRandomhappiness = 0\n //try the random arrangement 100 times to see if there are better matches\n for(let i=0;i<300;i++) {\n newRandomArrangement = randomOpt(events,groups)\n newRandomhappiness = totalHappiness(newRandomArrangement,groups)/numOsallistujat\n if(newRandomhappiness > randomhappiness) {\n randomhappiness = newRandomhappiness\n randomArrangement = newRandomArrangement\n }\n }\n return randomArrangement\n}\n","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":584,"value":"$30","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1038,"value":"checkArrangement(arrangement, groups,events) ? 'PADGopt tuottaa hyväksytyn sijoituksen' : 'PADGopt ei tuota hyväksyttyä sijoitusta'","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1081,"value":"checkArrangement(randomArrangement, groups,events) ? 'RandomArrangement tuottaa hyväksytyn sijoituksen' : 'RandomArrangement ei tuota hyväksyttyä sijoitusta'","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1035,"value":"$31","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":106,"value":"md `## Generoidaan optimoitava data`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":261,"value":"md `***L*** on lista, missä on jokaisen ryhmän jokaiseen tapahtumaan lisäämisestä saatava tyytyväisyys`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":264,"value":"L = {\n let L = []\n for(let i=0;i a.gain - b.gain)\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":151,"value":"md` ***groups*** on taulukko, jossa on henkilöiden nimet ja halukkuudet osallistua mihinkin tapahtumaan`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":158,"value":"$32","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":167,"value":"md `***events*** on taulukko, jossa on tapahtuman nimi ja minimi ja maksimimäärä osallistujia`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":206,"value":"events = {\n let e = []\n for(let i=0;i {\n //Returns random integer between 1 and val\n //'num' times. duplicate values are not allowed\n if(numValues===1) {\n return Math.floor(Math.random()*(maxNum-minNum+1)+minNum);\n } else {\n let randints = []\n for(let i=0;i el === u).length>0) {\n i = i-1\n continue\n }\n randints.push(u)\n }\n return randints\n }\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":486,"value":"totalHappiness = (M,grp) => {\n let happiness = 0\n M.forEach(m => {\n let grpInd = grp.findIndex(g=>g.name === m.name)\n let ind = grp[grpInd].pref.findIndex(ele => {\n return ele === m.assignment\n })\n ind = ind +1\n if(ind > 0) {\n happiness = happiness + 1/ind\n }\n })\n return happiness\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":15,"value":"md `## Importit ja api kutsut`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":93,"value":"names = persons.results.map(user => user.login.username)","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":58,"value":"persons = d3.json(`https://randomuser.me/api/?results=${numOsallistujat}`)","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":17,"value":"import {slider, button} from '@jashkenas/inputs'","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":69,"value":"d3 = require('d3')","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":178,"value":"vegalite = require('vega-lite')","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W33","stdlib":"1","titling":"auto"}} 2d:"$2c:body"