Ikr, I'm much too lazy to attempt that

its faster than using x**y % z due to it being a built in function (also more accurate).
to your actual question, i have no idea.

love the brute force! lol!

if you're using python, check what you do about negative indexes, maybe?

Note that you're supposed to evaluate a generation "one shot", based on the state at the previous generation only. Reading your pseudo-code, I'm not entirely sure you're not using intermediate results of the current generation to compute it itself (but that may just be the wording...)

while i love a good one liner, to others this is really gated code.

either way, Nice!

theres an oversight with my solution, along with me printing the variables. please ignore

perfect lol, exactly what i was asking for, thanks!

i am not getting your question exactly, so here it is what it is

this is dict comprehension similar to list comprehension (ex:{i:1 for i in range(2)} => {0:1,1:1}, i=key, 1=value) and int(hex, 16)(:or int(value, base)) is way to convert hex value to base 10.

would i represent the key where after the : is the value casted to int with respect to hex?

it feels great! now if only i could do the same on 4 lol

and now i feel stupid LOL great solution :)