On: 8402: 2048 from the other side

[jychang]

... Much higher than P pretty obviously. 16 possible drop points and 4 possible moves each turn maximum, let's say only half of each is available on average. That gives ((2)(8))^N for N amount of turns.

[tshaddox → jychang]

That's not really how computational complexity works.

[j2kun → jychang]

Why is there no better algorithm than exhaustive search of the game tree?