Revision as of 02:51, 29 March 2018

Motivation

Minimax is an important concept in game theory and search.

Negamax is a variant which relies on $\max(a,b)=-\min(-a,-b)$

While this technique is applicable to Chess (as Deep Blue employed to defeat Kasparov, we choose Connect Four as our context since it has a simpler game mechanic.

While the core part of searches like Minimax may be easy to parallelize, critical aspects such as alpha-beta pruning are more challenging.

@@ Line 6: / Line 6: @@
 While this technique is applicable to [https://en.wikipedia.org/wiki/Chess Chess] (as [https://en.wikipedia.org/wiki/Deep_Blue_(chess_computer) Deep Blue] [https://en.wikipedia.org/wiki/Deep_Blue_versus_Garry_Kasparov employed to defeat Kasparov], we choose [https://en.wikipedia.org/wiki/Connect_Four Connect Four] as our context since it has a simpler game mechanic.
-While the core part of searches like Minimax may be easy to parallelize, critical aspects of alpha-beta pruning are more challenging.
+While the core part of searches like Minimax may be easy to parallelize, critical aspects such as alpha-beta pruning are more challenging.
 =Background=