Re:The Mathematics of 2048: Counting States by Exhaustive En...
by maweki on Monday December 11, 2017 @02:51AM
(#15895706)
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.
[ Parent
| on HN ]
Re:The Mathematics of 2048: Counting States by Exhaustive En...
by ballenf on Monday December 11, 2017 @09:49AM
(#15897271)
I'd also think that working backwards from all possible winning states would offer some insight and potential for speed. At the expense of being somewhat more difficult (at first glance anyway) to ascertain validity of the predecessor state.
Re:The Mathematics of 2048: Counting States by Exhaustive En...
by jdleesmiller on Monday December 11, 2017 @01:48PM
(#15899254)
(Author here.) That would indeed be interesting, thanks --- I don't think it's trivial to generate all of the possible predecessor states, but it seems like it should be possible. One to think about.