Normally, programmers use minimax search with alpha-beta pruning or other heuristics algorithms for searching. In general, we have to deal with two major sub-problems, that’s (i) searching in the state space and (ii) finding the best evaluation function for the game.įor the games like Chess and Caro, the sub-problem (i) can be solved by using a wise optimization strategy and a fast enough computer. Computer Science did not undergo a revolution.Īn overview of Artificial Intelligence’s techniques for GamesĬonsidering the games of two opposing opponents like Chess, Caro or Go…, the answer to these problems can be referred to the state space search or combinatorial optimization problem. Though, Deep Blue’s technology turned out to be useful for chess only and not much else. At that time, the victory was widely described as milestone in AI. It was the first time that the world witnessed the historic event of a computer being worthy contender to one of the world’s sharpest mind. In 1997, the Deep Blue system of IBM defeated the world chess champion, Gary Kasparov. Deep Blue, An Artificial Intelligence Milestone What are the difference between the two systems and its meaning to the development of AI? This article will provide you with some fundamental information to answer this question.ġ. IBM’s Deep Blue (Deep Blue) and Google DeepMind’s AlphaGo (AlphaGo) are the two famous computer programs in the history of Artificial Intelligence (AI).
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |