Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

> keep going after you reach 2048. This game had to remove that option to achieve a 64bit state.

Since 15^16 < 2^64, you can still use a 64 bit state to reach 2^15=32768, which does not seem to be reachable in practice (the previous state would fill the whole board!)



I'm not sure how the math works out, but some googling suggests that 32768 is achievable in practice while 65536 and 131072 are theoretically possible but have only been achieved with undos.

edit: Explanation of the 131072 cap: https://puzzling.stackexchange.com/questions/48/what-is-the-...

Also, in one of the answers there someone claims to have achieved 65536 in practice


65536 has been achieved by 2 people without undos. However, it is very difficult as it’s only around a 7% chance with optimal play.

This is a partial video of one of them: https://youtube.com/watch?v=QQSLjPHg5P8


You need 16^16 for 32768 because 0 is used to represent an empty tile (2^0 = 1 is not used) which is exactly equal to 2^64.

The state in this implementation also stores a random seed (between 0 and 99, exclusive), so using 16^16 for the state would leave nothing for the random seed.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: