The Mathematics of 2048: Counting States by Exhaustive Enumeration

This is neat. I wonder whether there is a faster approach using binary decision diagrams or a variant thereof. If the state transition were represented by a binary function, BDDs could allow for counting states without actually enumerating. The question would be, how to actually find all the fixed points of that function.

Would be interesting to see alpha zero trained on 2048, conv nets seem well suited for this kind of game.

Neat. Seems a lot harder than the work I did to enumerate towers of Hanoi back in 2004:<p><a href="https:&#x2F;&#x2F;www.cs.carleton.ca&#x2F;sites&#x2F;default&#x2F;files&#x2F;tr&#x2F;TR-04-10.pdf" rel="nofollow">https:&#x2F;&#x2F;www.cs.carleton.ca&#x2F;sites&#x2F;default&#x2F;files&#x2F;tr&#x2F;TR-04-10.p...</a>

Whats the network&#x2F;gra[h library you used to draw those nice diagrams ?

Oh,I misread this title and thought it was going to be about maths in the year 2048.