Scalable Search in Computer Chess / Computational Intelligence (PDF)
Algorithmic Enhancements and Experiments at High Search Depths
(Sprache: Englisch)
The book presents new results of computer-chess research in the areas of selective forward pruning, the efficient application of game-theoretical knowledge, and the behaviour of the search at increasing depths. It shows how to make sophisticated game-tree...
sofort als Download lieferbar
eBook (pdf)
96.29 €
48 DeutschlandCard Punkte sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
Produktdetails
Produktinformationen zu „Scalable Search in Computer Chess / Computational Intelligence (PDF)“
The book presents new results of computer-chess research in the areas of selective forward pruning, the efficient application of game-theoretical knowledge, and the behaviour of the search at increasing depths. It shows how to make sophisticated game-tree searchers more scalable at ever higher depths. Throughout the whole book, the high-speed and master-strength chess program "DarkThought" serves as a realistic test vehicle to conduct numerous experiments at unprecedented search depths. The extensive experimental evaluations provide convincing empirical evidence for the practical usefulness of the presented techniques.
Advantages: - presentation of advanced and brand-new research results
in computer chess (e.g. selective pruning and other
search enhancements, improved endgame databases, etc.)
- numerous experiments at unprecedented search depths
- extensive experimental evaluation
- practical usefulness of new techniques proven within
strong state-of-the-art chess program "DarkThought"
- includes detailed implementation skeletons in ANSI-C
- contains concise introductions into the game of chess
and the basics of computer chess in general
Advantages: - presentation of advanced and brand-new research results
in computer chess (e.g. selective pruning and other
search enhancements, improved endgame databases, etc.)
- numerous experiments at unprecedented search depths
- extensive experimental evaluation
- practical usefulness of new techniques proven within
strong state-of-the-art chess program "DarkThought"
- includes detailed implementation skeletons in ANSI-C
- contains concise introductions into the game of chess
and the basics of computer chess in general
Autoren-Porträt von Ernst A. Heinz
Ernst A. Heinz earned his "Doktor" (Ph.D.) degree with "Auszeichnung"(summa cum laude) from the University of Karlsruhe, Germany, in July 1999 and
joined the Laboratory for Computer Science at the Massachusetts Institute of
Technology (M.I.T.), Boston/Cambridge, USA, as a Postdoctoral Fellow later
that year.
----- German -----
Ernst A. Heinz bestand seine Doktorprüfung an der Universität Karlsruhe im
Juli 1999 mit Auszeichnung und ist seit Herbst 1999 als "Postdoctoral
Fellow" am "Laboratory of Computer Science" des "Massachussetts Institute
of Technology" (M.I.T.) in Boston/Cambridge, USA.
Bibliographische Angaben
- Autor: Ernst A. Heinz
- 2013, 2000, 270 Seiten, Englisch
- Verlag: Vieweg+Teubner Verlag
- ISBN-10: 3322901785
- ISBN-13: 9783322901781
- Erscheinungsdatum: 01.12.2013
Abhängig von Bildschirmgröße und eingestellter Schriftgröße kann die Seitenzahl auf Ihrem Lesegerät variieren.
eBook Informationen
- Dateiformat: PDF
- Größe: 31 MB
- Ohne Kopierschutz
- Vorlesefunktion
Sprache:
Englisch
Kommentar zu "Scalable Search in Computer Chess / Computational Intelligence"
0 Gebrauchte Artikel zu „Scalable Search in Computer Chess / Computational Intelligence“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Scalable Search in Computer Chess / Computational Intelligence".
Kommentar verfassen