Scalable Search in Computer Chess: Algorithmic Enhancements and Experiments at High Search Depths
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 depth...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Wiesbaden
Vieweg+Teubner Verlag
2000
|
| Ausgabe: | 1st ed. 2000 |
| Schriftenreihe: | Computational Intelligence
|
| Schlagworte: | |
| Online-Zugang: | UBY01 URL des Eerstveröffentlichers |
| Zusammenfassung: | 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 |
| Beschreibung: | 1 Online-Ressource (XVIII, 270 p. 3 illus) |
| ISBN: | 9783322901781 |
| DOI: | 10.1007/978-3-322-90178-1 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV047064772 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 201216s2000 |||| o||u| ||||||eng d | ||
| 020 | |a 9783322901781 |9 978-3-322-90178-1 | ||
| 024 | 7 | |a 10.1007/978-3-322-90178-1 |2 doi | |
| 035 | |a (ZDB-2-SCS)978-3-322-90178-1 | ||
| 035 | |a (OCoLC)1227480741 | ||
| 035 | |a (DE-599)BVBBV047064772 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 082 | 0 | |a 620 |2 23 | |
| 100 | 1 | |a Heinz, Ernst A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Scalable Search in Computer Chess |b Algorithmic Enhancements and Experiments at High Search Depths |c by Ernst A. Heinz |
| 250 | |a 1st ed. 2000 | ||
| 264 | 1 | |a Wiesbaden |b Vieweg+Teubner Verlag |c 2000 | |
| 300 | |a 1 Online-Ressource (XVIII, 270 p. 3 illus) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Computational Intelligence | |
| 520 | |a 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 | ||
| 650 | 4 | |a Engineering, general | |
| 650 | 4 | |a Engineering | |
| 650 | 0 | 7 | |a Computerschach |0 (DE-588)4010456-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Spielbaum-Suchverfahren |0 (DE-588)4206785-6 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Computerschach |0 (DE-588)4010456-4 |D s |
| 689 | 0 | 1 | |a Spielbaum-Suchverfahren |0 (DE-588)4206785-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783528057329 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783322901798 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-322-90178-1 |x Verlag |z URL des Eerstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-SCS | ||
| 940 | 1 | |q ZDB-2-SCS_2000/2004 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032471883 | ||
| 966 | e | |u https://doi.org/10.1007/978-3-322-90178-1 |l UBY01 |p ZDB-2-SCS |q ZDB-2-SCS_2000/2004 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804182063234940928 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Heinz, Ernst A. |
| author_facet | Heinz, Ernst A. |
| author_role | aut |
| author_sort | Heinz, Ernst A. |
| author_variant | e a h ea eah |
| building | Verbundindex |
| bvnumber | BV047064772 |
| collection | ZDB-2-SCS |
| ctrlnum | (ZDB-2-SCS)978-3-322-90178-1 (OCoLC)1227480741 (DE-599)BVBBV047064772 |
| dewey-full | 620 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 620 - Engineering and allied operations |
| dewey-raw | 620 |
| dewey-search | 620 |
| dewey-sort | 3620 |
| dewey-tens | 620 - Engineering and allied operations |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| doi_str_mv | 10.1007/978-3-322-90178-1 |
| edition | 1st ed. 2000 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02998nmm a2200493zc 4500</leader><controlfield tag="001">BV047064772</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">201216s2000 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783322901781</subfield><subfield code="9">978-3-322-90178-1</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-322-90178-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-3-322-90178-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1227480741</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047064772</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">620</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Heinz, Ernst A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Scalable Search in Computer Chess</subfield><subfield code="b">Algorithmic Enhancements and Experiments at High Search Depths</subfield><subfield code="c">by Ernst A. Heinz</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2000</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Wiesbaden</subfield><subfield code="b">Vieweg+Teubner Verlag</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XVIII, 270 p. 3 illus)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Computational Intelligence</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Engineering, general</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Engineering</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Computerschach</subfield><subfield code="0">(DE-588)4010456-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Spielbaum-Suchverfahren</subfield><subfield code="0">(DE-588)4206785-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Computerschach</subfield><subfield code="0">(DE-588)4010456-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Spielbaum-Suchverfahren</subfield><subfield code="0">(DE-588)4206785-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783528057329</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783322901798</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-322-90178-1</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Eerstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2000/2004</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032471883</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-322-90178-1</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">ZDB-2-SCS_2000/2004</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV047064772 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T16:12:23Z |
| indexdate | 2024-07-10T09:01:35Z |
| institution | BVB |
| isbn | 9783322901781 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032471883 |
| oclc_num | 1227480741 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 1 Online-Ressource (XVIII, 270 p. 3 illus) |
| psigel | ZDB-2-SCS ZDB-2-SCS_2000/2004 ZDB-2-SCS ZDB-2-SCS_2000/2004 |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | Vieweg+Teubner Verlag |
| record_format | marc |
| series2 | Computational Intelligence |
| spelling | Heinz, Ernst A. Verfasser aut Scalable Search in Computer Chess Algorithmic Enhancements and Experiments at High Search Depths by Ernst A. Heinz 1st ed. 2000 Wiesbaden Vieweg+Teubner Verlag 2000 1 Online-Ressource (XVIII, 270 p. 3 illus) txt rdacontent c rdamedia cr rdacarrier Computational Intelligence 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 Engineering, general Engineering Computerschach (DE-588)4010456-4 gnd rswk-swf Spielbaum-Suchverfahren (DE-588)4206785-6 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Computerschach (DE-588)4010456-4 s Spielbaum-Suchverfahren (DE-588)4206785-6 s DE-604 Erscheint auch als Druck-Ausgabe 9783528057329 Erscheint auch als Druck-Ausgabe 9783322901798 https://doi.org/10.1007/978-3-322-90178-1 Verlag URL des Eerstveröffentlichers Volltext |
| spellingShingle | Heinz, Ernst A. Scalable Search in Computer Chess Algorithmic Enhancements and Experiments at High Search Depths Engineering, general Engineering Computerschach (DE-588)4010456-4 gnd Spielbaum-Suchverfahren (DE-588)4206785-6 gnd |
| subject_GND | (DE-588)4010456-4 (DE-588)4206785-6 (DE-588)4113937-9 |
| title | Scalable Search in Computer Chess Algorithmic Enhancements and Experiments at High Search Depths |
| title_auth | Scalable Search in Computer Chess Algorithmic Enhancements and Experiments at High Search Depths |
| title_exact_search | Scalable Search in Computer Chess Algorithmic Enhancements and Experiments at High Search Depths |
| title_exact_search_txtP | Scalable Search in Computer Chess Algorithmic Enhancements and Experiments at High Search Depths |
| title_full | Scalable Search in Computer Chess Algorithmic Enhancements and Experiments at High Search Depths by Ernst A. Heinz |
| title_fullStr | Scalable Search in Computer Chess Algorithmic Enhancements and Experiments at High Search Depths by Ernst A. Heinz |
| title_full_unstemmed | Scalable Search in Computer Chess Algorithmic Enhancements and Experiments at High Search Depths by Ernst A. Heinz |
| title_short | Scalable Search in Computer Chess |
| title_sort | scalable search in computer chess algorithmic enhancements and experiments at high search depths |
| title_sub | Algorithmic Enhancements and Experiments at High Search Depths |
| topic | Engineering, general Engineering Computerschach (DE-588)4010456-4 gnd Spielbaum-Suchverfahren (DE-588)4206785-6 gnd |
| topic_facet | Engineering, general Engineering Computerschach Spielbaum-Suchverfahren Hochschulschrift |
| url | https://doi.org/10.1007/978-3-322-90178-1 |
| work_keys_str_mv | AT heinzernsta scalablesearchincomputerchessalgorithmicenhancementsandexperimentsathighsearchdepths |