Last active
September 9, 2018 23:56
-
-
Save dschinkel/2cfc278dbcd7a2ed494fcc1f6db22007 to your computer and use it in GitHub Desktop.
miniMax Algorithm in Elm - Tests - next move wins for a row - Attempt 1 - Test Only
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| it "next move wins for a row" <| | |
| let | |
| gameNode = | |
| [ markerX, markerX, empty, empty, empty, empty, empty, empty, empty ] | |
| cellThreeIndex = | |
| 2 | |
| nextMove = | |
| Solver.nextBestMove gameNode | |
| in | |
| expect nextMove to equal cellThreeIndex |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment