Can Computers Master Chess Through Brute Force and Heuristics?

  • Thread starter Thread starter johncena
  • Start date Start date
  • Tags Tags
    Chess Computer
AI Thread Summary
Computers play chess through a combination of brute force calculations and heuristic algorithms. They analyze potential moves by searching through numerous possible game paths, but this exhaustive approach can be time-consuming. To optimize performance, programmers implement heuristics that help the computer prioritize certain moves and eliminate less promising options, allowing for quicker decision-making. This method enables computers to simulate strategic thinking without possessing true intelligence. Resources such as interactive applets illustrate how computers evaluate moves in real-time, showcasing the underlying mechanics of chess algorithms.
johncena
Messages
131
Reaction score
1
As a computer does not possesses any intelligence of it's own, how it plays games like chess?
 
Technology news on Phys.org
here is a really cool applet which visually shows you how a computer decides it's next move. just drag your piece somewhere legal, and watch the computer do it's magic.

http://turbulence.org/spotlight/thinking/chess.html
 
A short answer is, the computer tries to search all possible paths of play for several moves into the future. As a "brute force" approach, this would take too long, so the programmer tries to add heuristics to the chess program so that it can guess which paths to eliminate without projecting every possible path many steps into the future.
 
Dear Peeps I have posted a few questions about programing on this sectio of the PF forum. I want to ask you veterans how you folks learn program in assembly and about computer architecture for the x86 family. In addition to finish learning C, I am also reading the book From bits to Gates to C and Beyond. In the book, it uses the mini LC3 assembly language. I also have books on assembly programming and computer architecture. The few famous ones i have are Computer Organization and...
I had a Microsoft Technical interview this past Friday, the question I was asked was this : How do you find the middle value for a dataset that is too big to fit in RAM? I was not able to figure this out during the interview, but I have been look in this all weekend and I read something online that said it can be done at O(N) using something called the counting sort histogram algorithm ( I did not learn that in my advanced data structures and algorithms class). I have watched some youtube...
Back
Top