Detail Checkers is Solved   Oleh:  Schaeffer, Jonathan ; Burch, Neil ; Bjornsson, Yngvi ; Kishimoto, Akihiro ; Muller, Martin M. ; Lake, Robert ; Lu, Paul ; Sutphen, Steve Jenis: Article from Bulletin/Magazine Dalam koleksi: SCIENCE (keterangan: ada di Proquest) vol. 317 no. 5844 (Sep. 2007), page 1518. Ketersediaan Perpustakaan FK Nomor Panggil: S01.K.2007.08 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada     Lihat Detail Induk Isi artikel The game of checkers has roughly 500 billion billion possible positions (5 x 1020). The task of solving the game, determining the final result in a game with no mistakes made by either player, is daunting. Since 1989, almost continuously, dozens of computers have been working on solving checkers, applying state-of-the-art artificial intelligence techniques to the proving process. This paper announces that checkers is now solved: Perfect play by both sides leads to a draw. This is the most challenging popular game to be solved to date, roughly one million times as complex as Connect Four. Artificial intelligence technology has been used to generate strong heuristic-based game-playing programs, such as Deep Blue for chess. Solving a game takes this to the next level by replacing the heuristics with perfection. Opini Anda Klik untuk menuliskan opini Anda tentang koleksi ini! Kembali

Copyright © 2006, 2007 Unika Atma Jaya, all rights reserved