What is usually implied by solution is a strategy that *guarantees* some result. An optimal strategy in a probabilistic game can perhaps guarantee an average result over many games, but not a result in a single game.

One could theoretically construct a database with all possible backgammon games and deduce the chances of winning from every position – and so come with the best strategy. I think the problem is this database would be extremely large.

Games that may not have a winning strategy are those with some hidden information – Prisoner’s Dilemma and Poker come to mind.

Now that I think about it, I doubt Shesh-Besh (Backgammon) could actualy be solved so easily – it’s randomized, which adds another dimension of complexity to it all. It’s still a sucky game though, and I enjoy Checkers more as it’s less dependant on luck.

I know some players adhere to the view that backgammon is a game of skill, but to me it always looked like an ars game.