Up to day 19

Author: joshthompson

package-lock.json

@@ -2,6 +2,7 @@
   "name": "joshthompson-adventofcode",
   "version": "1.0.0",
   "dependencies": {
+    "js-csp": "^1.0.1",
     "static-server": "^3.0.0"
   },
   "main": "static-server.js",

package.json

@@ -1,17 +1,30 @@
 AdventOfCode.day09 = {
 
-	part1: input => {
-		let distances = {}
+	process: input => {
+		let network = {}
 		input.split('\n').forEach(text => {
-			let data = text.match(/([a-zA-Z]*) to ([a-zA-Z]*) = ([0-9]*)/i)
-			distances[data[1]] = distances[data[1]] ? distances[data[1]] : {}
-			distances[data[2]] = distances[data[2]] ? distances[data[2]] : {}
-			distances[data[1]][data[2]] = distances[data[2]][data[1]] = parseInt(data[3])
+			let d = text.match(/([a-zA-Z]*) to ([a-zA-Z]*) = ([0-9]*)/i)
+			network[d[1]] = network[d[1]] ? network[d[1]] : {}
+			network[d[2]] = network[d[2]] ? network[d[2]] : {}
+			network[d[1]][d[2]] = network[d[2]][d[1]] = parseInt(d[3])
+		})
+		console.log(network)
+		return network
+	},
+
+	findShortestRoute: (map) => {
+		_.forEach(distances, distance => {
+			let route = [city]
+			routes.push(route)
 		})
-		console.log(distances)
+	},
 
-		_.forEach(distances, () => {
-			
+	part1: input => {
+		let map = AdventOfCode.day09.process(input)
+		let routes = {}
+		let shortest = false
+		_.forEach(map, (distances, city) => {
+			AdventOfCode.day09.findShortestRoute(map)
 		})
 	},
 

src/2015/day09.js

@@ -1,25 +1,70 @@
 AdventOfCode.day01 = {
 
-	part1: input => {
+	part1: async (input, render) => {
 		let numbers = input.split('').map(i => parseInt(i))
 		numbers.push(numbers[0])
 		let sum = 0
 
 		for (let i = 0; i < numbers.length - 1; i++) {
 			sum += numbers[i] === numbers[i + 1] ? numbers[i] : 0
+			if (render) await AdventOfCode.day01.render(numbers, i, sum)
 		}
 		return sum
 	},
 
-	part2: input => {
+	part2: async (input, render) => {
 		let numbers = input.split('').map((i) => parseInt(i))
 		let sum = 0
 
 		for (let i = 0; i < numbers.length - 1; i++) {
-			j = (i + numbers.length / 2) % numbers.length
+			let j = (i + numbers.length / 2) % numbers.length
 			sum += numbers[i] === numbers[j] ? numbers[i] : 0
+			if (render) await AdventOfCode.day01.render2(numbers, i, sum)
 		}
 		return sum
+	},
+
+	renderHtml: "<canvas id='canvas1_1' style='height: 80px;'></canvas><canvas id='canvas1_2' style='height:95px;'></div>",
+
+	render: async (numbers, i, sum) => {
+		let c = document.getElementById('canvas1_1').getContext('2d')
+		let w = c.canvas.width = document.getElementById('canvas1_1').clientWidth
+		let h = c.canvas.height = document.getElementById('canvas1_1').clientHeight
+		
+		c.fillStyle = numbers[i] === numbers[i + 1] ? '#0F0' : '#FF0'
+		c.fillRect(10, 20, 30, 25)
+		c.fillStyle = '#000'
+
+		for (let num = i; num < numbers.length; num++) {
+			c.fillText(numbers[num], (num - i) * 15 + 15, 35)
+		}
+
+		c.fillText(`Part 1`, 15, 10)
+		c.fillText(`Sum: ${sum}`, 15, 60)
+
+		await sleep(10)
+	},
+
+	render2: async (numbers, i, sum) => {
+		let c = document.getElementById('canvas1_2').getContext('2d')
+		let w = c.canvas.width = document.getElementById('canvas1_2').clientWidth
+		let h = c.canvas.height = document.getElementById('canvas1_2').clientHeight
+		
+
+		let j = (i + numbers.length / 2) % numbers.length
+		c.fillStyle = numbers[i] === numbers[j] ? '#0F0' : '#FF0'
+		c.fillRect(10, 20, 15, 45)
+		c.fillStyle = '#000'
+
+		for (let num = i; num < numbers.length; num++) {
+			c.fillText(numbers[num], (num - i) * 15 + 15, 35)
+			c.fillText(numbers[(num + numbers.length / 2) % numbers.length], (num - i) * 15 + 15, 55)
+		}
+
+		c.fillText(`Part 1`, 15, 10)
+		c.fillText(`Sum: ${sum}`, 15, 80)
+
+		await sleep(10)
 	}
 
 }

src/2017/day01.js

@@ -1,18 +1,65 @@
 AdventOfCode.day03 = {
 
-	part1: n => {
+	part1: (n, render) => {
+		// Functions
+		let sideFn = level => 2 * level + 1
+		let startFn = level => Math.pow(sideFn(level - 1), 2) + 1
+
+		// Which level of the spiral we're on 
+		// Also the numbers of intial outward steps
+		let level = Math.floor(Math.ceil(Math.sqrt(n)) / 2)
+		let side = sideFn(level)
+		let start = startFn(level)
+		let offset = level - 1 // Offset from lowest value in level to middle
+
+		let distance = n
+		
+		for (let i = 0; i < 4; i++) { // Loop each side
+			let side_middle = start + offset + (side - 1) * i // Middle value for this side
+			let side_distance = Math.abs(side_middle - n)
+			distance = Math.min(distance, side_distance) // Keep shortest side distance
+		}
+
+		if (render) AdventOfCode.day03.render(parseInt(n), level, distance, 0)
+
+		return level + distance
+	},
+
+	part1_2: n => {
 		let level = Math.floor(Math.ceil(Math.sqrt(n)) / 2)
 		let side = 2 * level + 1
 		let highest = Math.pow(side, 2)
 		while (n + side < highest) n += side
 		return level + Math.abs(highest - (side - 1) / 2 - n)
 	},
 
+	processMove: (grid, x, y) => {
+		let g = (x, y) => grid[x + ',' + y] ? grid[x + ',' + y] : 0 // value of cell in grid
+		let c = (x, y) => !g(x, y) // is cell clear
+
+		// 			NORTH			EAST			SOUTH			WEST
+		if (		c(x, y-1) && 	c(x+1, y) && 	c(x, y+1) &&	c(x-1, y))	x += 1 // Everything is empty
+
+		else if (	c(x, y-1) &&	c(x+1, y) &&	!c(x, y+1) &&	c(x-1, y))	x -= 1 // Just south is blocked
+		else if (	c(x, y-1) &&	!c(x+1, y) &&	!c(x, y+1) &&	c(x-1, y))	x -= 1 // Just south and east are blocked
+
+		else if (	c(x, y-1) &&	!c(x+1, y) &&	c(x, y+1) &&	c(x-1, y))	y += 1 // Just east is blocked
+		else if (	!c(x, y-1) &&	!c(x+1, y) &&	c(x, y+1) &&	c(x-1, y))	y += 1 // Just north and east are blocked
+
+		else if (	!c(x, y-1) &&	c(x+1, y) &&	c(x, y+1) &&	c(x-1, y))	x += 1 // Just north is blocked
+		else if (	!c(x, y-1) &&	c(x+1, y) &&	c(x, y+1) &&	!c(x-1, y))	x += 1 // Just north and west are blocked
+
+		else if (	c(x, y-1) &&	c(x+1, y) &&	c(x, y+1) &&	!c(x-1, y))	y -= 1 // Just west is blocked
+		else if (	c(x, y-1) &&	c(x+1, y) &&	!c(x, y+1) &&	!c(x-1, y))	y -= 1 // Just south and west are blocked
+
+		return {x: x, y: y}
+	},
+
 	part2: input => {
 		let grid = {
 			'0,0': 1
 		}
-		let g = (x, y) => grid[x + ',' + y] ? grid[x + ',' + y] : 0// value of cell in grid
+		let g = (x, y) => grid[x + ',' + y] ? grid[x + ',' + y] : 0 // value of cell in grid
 		let c = (x, y) => !g(x, y) // is cell clear
 		let set = (x, y, value) => grid[x + ',' + y] = value
 
@@ -22,21 +69,9 @@ AdventOfCode.day03 = {
 
 		while (value < input) {
 			// Move to next cell
-
-			// 			NORTH			EAST			SOUTH			WEST
-			if (		c(x, y-1) && 	c(x+1, y) && 	c(x, y+1) &&	c(x-1, y))	x += 1 // Everything is empty
-
-			else if (	c(x, y-1) &&	c(x+1, y) &&	!c(x, y+1) &&	c(x-1, y))	x -= 1 // Just south is blocked
-			else if (	c(x, y-1) &&	!c(x+1, y) &&	!c(x, y+1) &&	c(x-1, y))	x -= 1 // Just south and east are blocked
-
-			else if (	c(x, y-1) &&	!c(x+1, y) &&	c(x, y+1) &&	c(x-1, y))	y += 1 // Just east is blocked
-			else if (	!c(x, y-1) &&	!c(x+1, y) &&	c(x, y+1) &&	c(x-1, y))	y += 1 // Just north and east are blocked
-
-			else if (	!c(x, y-1) &&	c(x+1, y) &&	c(x, y+1) &&	c(x-1, y))	x += 1 // Just north is blocked
-			else if (	!c(x, y-1) &&	c(x+1, y) &&	c(x, y+1) &&	!c(x-1, y))	x += 1 // Just north and west are blocked
-
-			else if (	c(x, y-1) &&	c(x+1, y) &&	c(x, y+1) &&	!c(x-1, y))	y -= 1 // Just west is blocked
-			else if (	c(x, y-1) &&	c(x+1, y) &&	!c(x, y+1) &&	!c(x-1, y))	y -= 1 // Just south and west are blocked
+			let pos = AdventOfCode.day03.processMove(grid, x, y)
+			x = pos.x
+			y = pos.y
 
 			// Calculate total
 			value = g(x-1, y-1) + g(x+0, y-1) + g(x+1, y-1)
@@ -47,6 +82,54 @@ AdventOfCode.day03 = {
 
 		return value
 
+	},
+
+	renderHtml: '<canvas id="canvas3_1" style="height: 500px;"></canvas>',
+
+	render: async (n, level, distance, frame) => {
+		let c = document.getElementById('canvas3_1').getContext('2d')
+		let w = c.canvas.width = document.getElementById('canvas3_1').clientWidth
+		let h = c.canvas.height = document.getElementById('canvas3_1').clientHeight
+		let max = 2000
+		c.font = '8px Verdana'
+		while (!n || parseInt(n) <= 1 || parseInt(n) > max) n = parseInt(prompt(`Number to find (Integer from 2 - ${max})`))
+		console.log(parseInt(n))
+		let grid = {}
+		let size = 22
+		let x = 0
+		let y = 0
+		let i = 1
+
+		// Draw grid
+		while (i <= n) {
+			let pos = AdventOfCode.day03.processMove(grid, x, y)
+			x = pos.x
+			y = pos.y
+			c.fillText(i, w/2 + x * size, h/2 + y * size / 2)
+			grid[x + ',' + y] = i+1
+			i++
+			await sleep(1)
+		}
+
+		let xa = x / Math.abs(x)
+		let ya = y / Math.abs(y)
+		let cx = 0
+		let cy = 0
+		let colour = 0
+		for (cx = 0; Math.abs(cx) <= Math.abs(x) + (x>0?-2:0); cx += xa) {
+			c.fillStyle = `hsla(${137*colour++}, 100%, 50%, 0.5)`
+			c.fillRect(w/2 + (cx + 0.8) * size, h/2 + (cy - 0.8)  * size / 2, size, size / 2)
+			await sleep(25)
+		}
+		for (cy = 0; Math.abs(cy) <= Math.abs(y); cy += ya) {
+			c.fillStyle = `hsla(${137*colour++}, 100%, 50%, 0.5)`
+			c.fillRect(w/2 + (cx + 0.8) * size, h/2 + (cy - 0.8)  * size / 2, size, size / 2)
+			await sleep(25)
+		}
+		c.fillRect = w/2 - 5
+
+
+
 	}
 
 }

src/2017/day03.js

@@ -6,9 +6,9 @@ AdventOfCode.day10 = {
 		return list[0] * list[1]
 	},
 
-	part2: input => {
+	part2: (input, rounds) => {
 		let lengths = input.split('').map(c => c.charCodeAt(0)).concat(17, 31, 73, 47, 23)
-		let list = AdventOfCode.day10.process(lengths, 64)
+		let list = AdventOfCode.day10.process(lengths, rounds ? rounds : 64)
 		let dense = []
 		while (list.length) dense.push(list.splice(0, 16).reduce((a, b) => a ^ b))
 		return dense.map(x => x.toString(16)).map(x => x.length === 1 ? '0' + x : x).join('')
@@ -37,4 +37,6 @@ AdventOfCode.day10 = {
 		return list
 	}
 
-}
+}
+
+AdventOfCode.knotHash = (input, rounds) => AdventOfCode.day10.part2(input, rounds) // For use in other days tasks