![]() ![]() On the other hand, the game of Go has approximately 10 170 different configurations. The complexity of Chess can be quantified by calculating the total number of board positions, which equals roughly 10 47 possibilities. This relies heavily on brute force computing, which requires either a lot of time, a lot of computation power, or both. In the case of Deep Blue, the program was designed to evaluate the relative risk of every possible position for each Chess piece at each turn. Of course, the puzzle is given with a number of the cells empty, and the goal is to fill in the empty cells until the conditions are satisfied.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |