Tag Info

Hot answers tagged

11

Has the Monte Carlo method already been applied to other games? (Are there concrete implementations available? Yes. This Grad paper might be of interest to you. It covers Backgammon, Bridge, Go, Scrabble, and Clobber. Backgammon, implementation TD-gammon. Bridge, implementation Bridge Barron. Probably outclassed these days by other computer ...


7

On an 19x19 board there is no computer that evens top level players (9p) as of November 2011. It seems that the strongest programs for the moment use Monte Carlo methods and from time to time matches with pro's are organised, though usually with handicap. The level reached by programs for the last couple of years seems to indicate that they need at least 7 ...


3

First, one needs to understand the differences between Chess and Go from a game complexity standpoint. Next, one must understand the differences between the two types of AI algorithms, and why one works for Chess and the other doesn't. Both chess and Go are perfect information games with no stochastic elements. This means you can always see the full state ...


1

My perspective is having never played Haggis until i played it on the ipad. I have quite a bit of Tichu experience. The AI offered competition to me for about 5 games. After that i can beat it 4/5 of the time. So overall i think it is a good way to learn the game, but will not help you get ahead online


1

Ok, I did a little bit of research. Quoting this paper: In the last few years, several Monte-Carlo based techniques emerged in the field of computer games. They have already been applied successfully to many games, including POKER (Billings et al. 2002) and SCRABBLE (Sheppard 2002). Monte-Carlo Tree Search (MCTS), a Monte-Carlo based technique that ...


1

To my knowledge, no. I barely know how to play go, but I can speak to the AI side of things a bit. Deep Blue basically uses a big ol' search tree to look many, many moves into the future, like it's testing out numerous parallel games. If a series of moves doesn't terminate in a win or loss, a unit called the "static evaluator" applies a bunch of heuristics ...



Only top voted, non community-wiki answers of a minimum length are eligible