Year: 1994
Type: dissertation
Abstract: 1 Speculations and AI 1.2 Identifying the obstacles 1.3 Uncovering hidden obstacles 1.4 The problem statement 1.5 Solving games 1.6 Thesis outline 2 Proof-Number Search 2.1 Knowledge representation and search 2.2 Pn-search: the algorithm 2.2.1 The AND/OR-tree model 2.2.2 Main assumptions of pn-search 2.2.3 Informal description of pn-search 2.2.4The pn-search algorithm 2.3 Enhancements 2.3.1 Reducing memory requirements 2.3.2Reducing execution time 2.3.3Applying domain-specific knowledge 2.3.4Transpositions 2.4 Results 2.4.1 Introduction 2.4.2The rules of awari VII vm CONTENTS 2.4.3Tournament programs 2.4.4The algorithms compared 2.4.5 Comparing the performances 2.4.6 Test positions 2.4.7 Results 2.4.8 Conclusions 2.5 Related algorithms 2.5.1 Conspiracy-number search 2.5.2SSS* 2.5.3B* 2.5.4 A* 3 Dependency-Based Search • i V> *3 CONTENTS .DC 4.5 Solving qubic -A .5.S.Ô . .73! 4.5.1 Subdividing the game tree iiârfJÛt .S.K.a . .89i 4.5.2Statistics i;:-#d3..I.S.a . .#<«; 4.5.3Comparison with Patashnik 4.5.4Reliability .«ficrb agsnMO 01.£.9 5 Go-Moku L'juaH i i .O 5.1 Background 5.2 Rules and strategies £••• , 5.2.1 Rules ,.; 5.2.2 Threats and threat trees 5.2.3 Human strategies 5.3 Applying db-search 5.3.1 A single-agent search in go-moku S> • 5.3.2A db-search framework for go-moku ;,-i 5.3.3Go-moku specific enhancements to db-search !-5.3.4Heuristically improving the efficiency of db-search . .139 5.3.5Additional requirements for standard go-moku . . . .5.4 Applying pn-search 5.4.1 Go-moku as an AND/OR tree 5.4.2Enhancements 5.5 Solving go-moku 5.5.1 Victoria's I/O 5.5.2Subdividing the game tree 5.5.3Statistics 5.5.4Reliability6 Which Games Will Survive? 6.1 Scope 6.2 Game properties 6.2.1 Perfect information 6.2.2 Convergence 6.2.3 Sudden death 6.2.4 Complexity 6.3 The games of the Olympic List 6.3.1 Qubic 6.3.2Connect-Four 6.3.3Go-moku 6.3.4Nine men's morris CONTENTS GO? 6.3.5 Awari «20 i 6.3.6 Othello tii i :. £1 6.3.7 Checkers s : 6.3.8Draughts 169 *; 6.3.9Chess 6.3.10Chinese chess •'-'.6.3.11Renju 6.3.12Go 6.3.13Scrabble 6.3.14Backgammon 6.3.15Bridge 6.4 Reviewing the problem statement 6.4.1 The research questions 6.4.2The problem statement 6.5 Predictions . . . . .' 6.5.1 Future playing strength 6.5.2The future of games
Author: L.V. Allis
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1512315140
