Searching for solutions in games and artificial intelligence

L.V. Allis · 1994

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.4A* 3 Dependency-Based Search • i V> *^ 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 A Domain-specific solution to DLP 185

Read the paper · More papers on PaperTik