Difference between revisions of "Connect Four"

From CSE231 Wiki
Jump to navigation Jump to search
Line 25: Line 25:
  
 
==Parallel Choose Your Own Adventure==
 
==Parallel Choose Your Own Adventure==
===forall===
+
Choose one of the following paths:
 +
===path a) forall===
 
{{CodeToImplement|ParallelForallConnectFour|negamax|connectfour.challenge.chooseyourownadventure.forall}}
 
{{CodeToImplement|ParallelForallConnectFour|negamax|connectfour.challenge.chooseyourownadventure.forall}}
  
 
{{Parallel|public static ColumnEvaluationPair negamax(Board board, Player playerWhoseTurnItIs, Config config, int currentDepth)}}
 
{{Parallel|public static ColumnEvaluationPair negamax(Board board, Player playerWhoseTurnItIs, Config config, int currentDepth)}}
  
===futures===
+
===path b) futures===
 
{{CodeToImplement|ParallelFuturesConnectFour|negamax|connectfour.challenge.chooseyourownadventure.futures}}
 
{{CodeToImplement|ParallelFuturesConnectFour|negamax|connectfour.challenge.chooseyourownadventure.futures}}
  
 
{{Parallel|public static ColumnEvaluationPair negamax(Board board, Player playerWhoseTurnItIs, Config config, int currentDepth)}}
 
{{Parallel|public static ColumnEvaluationPair negamax(Board board, Player playerWhoseTurnItIs, Config config, int currentDepth)}}
 +
 +
===path c) recursive tasks===
 +
{{CodeToImplement|NegamaxTask|compute|connectfour.challenge.chooseyourownadventure.recursivetasks}}
 +
 +
{{Parallel|public ColumnEvaluationPair compute()}}
  
 
=Testing Your Solution=
 
=Testing Your Solution=

Revision as of 03:07, 29 March 2018

Motivation

Minimax is an important concept in game theory and search.

Negamax is a variant which relies on

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.

Background

Solving Connect Four

Code To Implement

Win or Lose Heuristic

class: WinOrLoseHeuristic.java Java.png
methods: evaluate
package: connectfour.challenge
source folder: student/src/main/java

method: public double evaluate(Board board, Player color, Config config, int currentDepth) Sequential.svg (sequential implementation only)

Sequential Negamax

class: SequentialConnectFour.java Java.png
methods: negamax
package: connectfour.challenge
source folder: student/src/main/java

method: public static ColumnEvaluationPair negamax(Board board, Player playerWhoseTurnItIs, Config config, int currentDepth) Sequential.svg (sequential implementation only)

Parallel Choose Your Own Adventure

Choose one of the following paths:

path a) forall

class: ParallelForallConnectFour.java Java.png
methods: negamax
package: connectfour.challenge.chooseyourownadventure.forall
source folder: student/src/main/java

method: public static ColumnEvaluationPair negamax(Board board, Player playerWhoseTurnItIs, Config config, int currentDepth) Parallel.svg (parallel implementation required)

path b) futures

class: ParallelFuturesConnectFour.java Java.png
methods: negamax
package: connectfour.challenge.chooseyourownadventure.futures
source folder: student/src/main/java

method: public static ColumnEvaluationPair negamax(Board board, Player playerWhoseTurnItIs, Config config, int currentDepth) Parallel.svg (parallel implementation required)

path c) recursive tasks

class: NegamaxTask.java Java.png
methods: compute
package: connectfour.challenge.chooseyourownadventure.recursivetasks
source folder: student/src/main/java

method: public ColumnEvaluationPair compute() Parallel.svg (parallel implementation required)

Testing Your Solution

Visualization

class: ConnectFourVizApp.java VIZ
package: connnectfour.challenge
source folder: student/src//java

Correctness

class: ConnectFourTestSuite.java Junit.png
package: connnectfour.challenge
source folder: testing/src/test/java