Computers in Chess: Solving Inexact Search Problems

Computers in Chess: Solving Inexact Search Problems

아직 평점이 없습니다
Sep 26, 2011 · 영어 · 페이퍼백 (172 페이지)
서가에 추가

이 책 평가하기


도서 일지 내보내기

책 세부 정보

형식 페이퍼백
페이지 172
언어 영어
출판됨 Sep 26, 2011
출판사 Springer
Softcover reprint of the original 1st ed. 1984
ISBN-10 1461297362
ISBN-13 9781461297369

설명

M. M. Botvinnik delves into the intricate world of chess, exploring the intersection of artificial intelligence and strategic gaming. The work examines how computers approach the challenges posed by chess, particularly when faced with ambiguity in search processes. Botvinnik’s insights highlight both the advancements in computational techniques and the limitations that still emerge when a machine tries to mimic human intuition.

Throughout the narrative, the author sheds light on various algorithms and their efficacy in navigating the vast complexities of chess positions. The strategic depth of the game offers a rich backdrop for discussing broader concepts in symbolic computation, demonstrating how artificial intelligence has evolved to tackle cognitive tasks previously thought to be the exclusive domain of human intellect.

Botvinnik’s analytical approach encourages readers to reconsider the nature of problem-solving in chess. By addressing inexact search problems, he invites both enthusiasts and practitioners to engage with the nuances of algorithmic design and its practical applications, making this work a compelling resource for those interested in the crossroads of technology and traditional gameplay.
서가에 추가

이 책 평가하기


도서 일지 내보내기