人机对弈编程概述

人机对弈编程概述赖勇浩 2005.12.28

抽象原理初始状态衍生状态状态评估作出决策走法生成搜索算法棋盘表示

1) 棋盘表示 ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

一 9*10的二维数组表示法 ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],98 97 96 95 94 93 92 91 90 88 87 86 85 84 83 82 81 80 78 77 76 75 74 73 72 71 70 68 67 66 65 64 63 62 61 60 58 57 56 55 54 53 52 51 50 48 47 46 45 44 43 42 41 40 38 37 36 35 34 33 32 31 30 28 27 26 25 24 23 22 21 20 18 17 16 15 14 13 12 11 10 08 07 06 05 04 03 02 01 00

二 90的一维数组表示法 ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],89 88 87 86 85 84 83 82 81 80 79 78 77 76 75 74 73 72 71 70 69 68 67 66 65 64 63 62 61 60 59 58 57 56 55 54 53 52 51 50 49 48 47 46 45 44 43 42 41 40 39 38 37 36 35 34 33 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 09 08 07 06 05 04 03 02 01 00

三 13*14的一维数组表示法 181 180 179 178 177 176 175 174 173 172 171 170 169 168 167 166 165 164 163 162 161 160 159 158 157 156 155 154 153 152 151 150 149 148 147 146 145 144 143 142 141 140 139 138 137 136 135 134 133 132 131 130 129 128 127 126 125 124 123 122 121 120 119 118 117 116 115 114 113 112 111 110 109 108 107 106 105 104 103 102 101 100 99 98 97 96 95 94 93 92 91 90 89 88 87 86 85 84 83 82 81 80 79 78 77 76 75 74 73 72 71 70 69 68 67 66 65 64 63 62 61 60 59 58 57 56 55 54 53 52 51 50 49 48 47 46 45 44 43 42 41 40 39 38 37 36 35 34 33 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 09 08 07 06 05 04 03 02 01 00

三 13*14的一维数组表示法 ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

五 16*16的一维数组表示法

[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

六棋盘-棋子数组和位行位列 ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

2) 走法生成 ,[object Object],[object Object],[object Object],[object Object]

3) 搜索算法 ,[object Object],[object Object],[object Object]

3.1 Min-Max ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],　　　 best = val; 　　 } 　 } 　 return best; } 　 int Min(int depth) { 　 int best = INFINITY; 　 // 注意这里不同于 “ 最大 ” 算法　 if (depth <= 0) { 　　 return Evaluate(); 　 } 　 GenerateLegalMoves(); 　 while (MovesLeft()) { 　　 MakeNextMove(); 　　 val = Max(depth - 1); 　　 UnmakeMove(); 　　 if (val < best) { 　 // 注意这里不同于 “ 最大 ” 算法　　　 best = val; 　　 } 　 } 　 return best; }

3.2 NegaMax ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

3.3 Alpha-Beta ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],　　 if (val > alpha) { 　　　 alpha = val; 　　 } 　 } 　 return alpha; }

3.3 不得不说的问题 ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

3.4.1 Transposition Table ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

3.4.2 Zobrist Hash ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

3.4.2 Zobrist Hash ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

3.5 Iterative Deepening ,[object Object]

3.6 Principal Variation Search ,[object Object],[object Object],[object Object],[object Object]

3.6 Principal Variation Search ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],　　撤消着法 m; 　　 if (score >= current) { 　　　 current = score; 　　　 bestmove = m; 　　　 if (score >= alpha) { 　　　　 alpha = score; 　　　 } 　　　 if (score >= beta) { 　　　　 break; 　　　 } 　　 } 　 } 　 return current; }

3.7 Null-Move Forward Pruning ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

3.8 Null-Move Forward Pruning ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],　　 val = -AlphaBeta(depth - 1, -beta, -alpha); 　　 UnmakeMove(); 　　 if (val >= beta) { 　　　 return beta; 　　 } 　　 if (val > alpha) { 　　　 alpha = val; 　　 } 　 } 　 return alpha; }

3.9 Quiescence Search ,[object Object],[object Object],[object Object],[object Object]

3.9 Quiescence Search ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],　　 if (score >= alpha) { 　　　 alpha = score; 　　　 if (score >= beta) { 　　　　 break; 　　　 } 　　 } } 　 return score; ｝

3.10 其它搜索算法 ,[object Object],[object Object],[object Object],[object Object]

3.11 我们可以做到怎么样? -75% Null-Move -25% Iterative Deepening -50% Transposition Table -10% PVS -35% 位行位列效果技术名称

4) 其它话题1 ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

4) 其它话题2 ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

结束语 ,[object Object],[object Object],[object Object],[object Object],[object Object]

人机对弈编程概述

Recommended

Recommended

More Related Content

What's hot

What's hot (20)

Viewers also liked

Viewers also liked (9)

Similar to 人机对弈编程概述

Similar to 人机对弈编程概述 (20)

More from 勇浩赖

More from 勇浩赖 (20)