| | Class | Description |
|---|
| | AlphaBeta |
Search enhancements
All techniques above aimed at reducing the number of nodes to search by better move ordering. |
| | AttackFalse |
AttackFalse.as class.(假进攻)
|
| | DR | |
| | ETC | |
| | MiniMax |
MiniMax.as class.
The idea here is that both players will try all possible moves in their position and then choose, respectively,
the one which makes the value of the position as high as possible (the white side) or as low as possible (black).
I have called one color 'WHITE', this is the side which tries to maximize the value,
and the other side tries to minimize the value. |
| | MinMax |
This essay is a detailed explanation of one of the most important
data structures ever created for Game Artificial Intelligence. |
| | MTDF | |
| | NegaMax |
The normal MiniMax code is a bit clumsy,
since one side is trying to maximize the value and the other
is trying to minimize - therefore,
with MiniMax we always have to check if we are the side
trying to maximize or the side trying to minimize. |
| | NegaScout |
NegaSout.as class. |
| | PVS |
PVS.as class. |
| | Quiescence | |
| | RandomWalk |
This essay is a detailed explanation of one of the most important
data structures ever created for Game Artificial Intelligence. |
| | SE | |
| | SearchingBase |
This essay is a detailed explanation of one of the most important
data structures ever created for Game Artificial Intelligence. |
| | ShortSighted |
About ShortSightedAI(鼠目寸光)
Cannot see beyond one's nose;
This essay is a detailed explanation of one of the most important
data structures ever created for Game Artificial Intelligence. |
| | Windowing | |
