felixN

Thanks for your help! I will try it out :)

I will fix that, thanks for the info

I run 100 games - the algorithm needs 949 rounds in average to reach the 2048 tile

Yes, true. I had the A* Algorithm in mind when I have implemented it, but the outcome really differs from that.

You are right, the first cost function doesn't make a lot of sense, but I didn't divide by the number of leafs - so it basically also was based on the number of unassigned tiles.

So in the end you are right these approaches are more or less the same.