All Questions
1
question with a bounty
6
votes
3answers
147 views
+50
Why does Min-Max algorithm delays a good move indefinitely?
Consider a simple chess example:
Q is white Queen.
K, R is black King and black Rook respectively.
A B
1 . Q
2 . .
3 K .
4 . .
5 . .
6 R .
7 . .
8 . R
1,2......
