# position: tuple (x, y) - dictionary key
			# luminosity: number value
			octo_field = {(0, 0): 6, (1, 0): 3, ..., (9, 9): 8}
			
			# who are the neighbors of the octopus sitting on
			# (3, 4)?
			# x + offset_x, y + offset_y
			neighbor_offsets = [
				(-1, -1), (-1, 0), (-1, 1),
				(0, -1), (0, 1),
				(1, 1), (1, 0), (1, -1),
			]
		

3D (x, y, z)

26 neighbors

4D (x, y, z, w)

80 neighbors

😭

There has to be better way!

There has to be better way!

class collections.Counter([iterable-or-mapping])

most_common([n])
	Return a list of the n most common elements.

total()
	Compute the sum of the counts.
		

			>>> from collections import Counter
			>>> lanternfish = {0: 45, 1: 235, 2: 534, 19: 3,}
			>>> c = Counter(lanternfish)
			>>> c.total()
			817
			>>> c.most_common(1)
			[(2, 534)]
			>>> c[20]
			0
		

			mem[45673] = 370803
			mem[322] = 92667525
		

			# mem[45673] = 370803
			>>> left = line[line.index("[")+1:line.index("]")]
			>>> right = line[line.index("=")+2:]
		

"Regular Expression HOWTO"

https://docs.python.org/3/howto/regex.html#regex-howto

		# mem[45673] = 370803
		>>> left = line[line.index("[")+1:line.index("]")]
		>>> right = line[line.index("=")+2:]
		# vs
		>>> pattern = r"mem\[(\d+)\] = (\d+)"