From the course: AI Algorithms for Game Design with Python

Unlock this course with a free trial

Join today to access over 24,800 courses taught by industry experts.

Time complexity of chess

Time complexity of chess - Python Tutorial

From the course: AI Algorithms for Game Design with Python

Start my 1-month free trial Buy for my team

Time complexity of chess

“

- [Instructor] Now, how about chess? Well, chess is a very much more complicated game than Tic-Tac-Toe and certainly not a solved game. Let me give you an idea of the complexity of chess. Consider a game that ends after 40 pairs of moves, 40 for white and 40 for black. A pretty accurate estimate is 10 to the 40 possible games. So how long would this take to compute? This is where the fun begins. Imagine a computer that is capable of processing a whole game of chess in one nanosecond. By game, I mean a state in the search tree, a chessboard. This is very optimistic because today a computer may be expected to perform a single operation in one nanosecond, an operation like an addition or a multiplication, not checking all 64 squares in a chess game. But let's dream. So in this computer, producing one move would take 10 to the 40 nanoseconds. That's about 300 times 10 to the 21 years. Okay, let's dream some more. Your computer probably has somewhere between two and eight CPU cores, which…

Contents