Tinkering with code and algorithms for fun
Day 1 - Report RepairDay 2 - Password PhilosophyDay 3 - Toboggan TrajectoryDay 4 - Passport ProcessingDay 5 - Binary BoardingDay 6 - Custom CustomsDay 7: Handy HaversacksDay 8 - Handheld HaltingDay 9 - Encoding ErrorDay 10 - Adapter ArrayDay 12 - Rain RiskDay 13 - Shuttle SearchDay 14 - Docking DataDay 15 - Rambunctious RecitationDay 16 - Ticket TranslationDay 17 - Conway CubesDay 18 - Operation OrderDay 19 - Monster Messages (part one)
Day 11 - Seating System
function q1(input) {
const height = input.length;
const width = input[0].length;
let state = [];
let state2 = [];
for (const row of input) {
state.push(...row);
state2.push(...row);
}
let changedState = true;
const { max, min } = Math;
const FLOOR = 0;
const EMPTY = 1;
const OCCUPIED = 10;
const CROWDED = OCCUPIED * 4;
const maxTurns = 100;
let turns = 0;
let results = [];
do {
changedState = false;
for (let y = 0; y < height; y++) {
const jStart = max(y - 1, 0);
const jEnd = min(y + 2, height);
for (let x = 0; x < width; x++) {
let seat = state[x + y * width];
// skip floor tiles;
if (seat === FLOOR) continue;
// count adjacent occupied seats
let adjacent = -seat; // we don't want to include our current seat
const iStart = max(x - 1, 0);
const iEnd = min(x + 2, width);
for (let j = jStart; j < jEnd; j++) {
for (let i = iStart; i < iEnd; i++) {
adjacent += state[i + j * width];
}
}
if (adjacent >= CROWDED && seat === OCCUPIED) {
changedState = true;
state2[x + y * width] = EMPTY;
} else if (adjacent < OCCUPIED && seat === EMPTY) {
changedState = true;
state2[x + y * width] = OCCUPIED;
}
}
}
for (let i = 0; i < state.length; i++) {
state[i] = state2[i];
}
results.push(makeTiles(state, width));
} while (changedState && ++turns < maxTurns);
let totalOccupied = 0;
for (const tile of state) {
totalOccupied += tile === OCCUPIED;
}
return { results, totalOccupied, turns, changedState, state };
}
answer1 = q1(input)
function q2(input, renderSize = 9) {
const height = input.length;
const width = input[0].length;
let state = [];
let state2 = [];
for (const row of input) {
state.push(...row);
state2.push(...row);
}
let changedState = true;
const { max, min } = Math;
const FLOOR = 0;
const EMPTY = 1;
const OCCUPIED = 10;
const CROWDED = OCCUPIED * 5;
const maxTurns = 100;
let turns = 0;
let results = [];
const directions = [
[-1, -1],
[-1, 0],
[-1, 1],
[0, -1],
[0, 1], // skip [0,0] since that's not going anywhere
[1, -1],
[1, 0],
[1, 1]
];
const inside = (x, y) => {
return x >= 0 && x < width && y >= 0 && y < height;
};
do {
changedState = false;
for (let y = 0; y < height; y++) {
for (let x = 0; x < width; x++) {
let seat = state[x + y * width];
// skip floor tiles;
if (seat === FLOOR) continue;
// count adjacent occupied seats
let adjacent = 0;
for (const [dx, dy] of directions) {
let i = dx,
j = dy;
let neighbor = FLOOR;
while (inside(x + i, y + j)) {
neighbor = state[x + i + (y + j) * width];
if (neighbor !== FLOOR) break;
i += dx;
j += dy;
}
adjacent += neighbor;
}
if (adjacent >= CROWDED && seat === OCCUPIED) {
changedState = true;
state2[x + y * width] = EMPTY;
} else if (adjacent < OCCUPIED && seat === EMPTY) {
changedState = true;
state2[x + y * width] = OCCUPIED;
}
}
}
for (let i = 0; i < state.length; i++) {
state[i] = state2[i];
}
results.push(makeTiles(state, width, renderSize));
} while (changedState && ++turns < maxTurns);
let totalOccupied = 0;
for (const tile of state) {
totalOccupied += tile === OCCUPIED;
}
return { results, totalOccupied, turns, changedState, state };
}
testAnswer2 = q2(testInput, 20)
testAnswer2.results[6]
answer2 = q2(input)
One platform to build and deploy the best data apps
Experiment and prototype by building visualizations in live JavaScript notebooks. Collaborate with your team and decide which concepts to build out.
Use Observable Framework to build data apps locally. Use data loaders to build in any language or library, including Python, SQL, and R.
Seamlessly deploy to Observable. Test before you ship, use automatic deploy-on-commit, and ensure your projects are always up-to-date.