danbarber/chess
1
0
Fork 0
mirror of https://github.com/danbee/chess synced 2025-03-04 08:39:06 +00:00
Code Issues Releases Wiki Activity

Re-order diagonal moves

Browse Source
This commit is contained in:
Daniel Barber 2018-03-12 15:50:55 -04:00
parent 8c9d52a0a4
commit 4513bf324c
Signed by: danbarber
GPG Key ID: 931D8112E0103DD8
2 changed files with 4 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
test/chess/moves/bishop_test.exs
View File

@ -8,10 +8,8 @@ defmodule Chess.Moves.BishopTest do
moves = Moves.available(board, {4, 5}) moves = Moves.available(board, {4, 5})
expected_moves = Enum.sort([ expected_moves = Enum.sort([
{5, 6}, {6, 7}, {0, 1}, {1, 2}, {2, 3}, {3, 4}, {5, 6}, {6, 7},
{5, 4}, {6, 3}, {7, 2}, {2, 7}, {3, 6}, {5, 4}, {6, 3}, {7, 2},
{3, 4}, {2, 3}, {1, 2}, {0, 1},
{3, 6}, {2, 7},
]) ])
assert Enum.sort(moves) == expected_moves assert Enum.sort(moves) == expected_moves
end end

6
test/chess/moves/queen_test.exs
View File

@ -10,10 +10,8 @@ defmodule Chess.Moves.QueenTest do
expected_moves = Enum.sort([ expected_moves = Enum.sort([
{4, 0}, {4, 1}, {4, 2}, {4, 3}, {4, 4}, {4, 6}, {4, 7}, {4, 0}, {4, 1}, {4, 2}, {4, 3}, {4, 4}, {4, 6}, {4, 7},
{0, 5}, {1, 5}, {2, 5}, {3, 5}, {5, 5}, {6, 5}, {7, 5}, {0, 5}, {1, 5}, {2, 5}, {3, 5}, {5, 5}, {6, 5}, {7, 5},
{5, 6}, {6, 7}, {0, 1}, {1, 2}, {2, 3}, {3, 4}, {5, 6}, {6, 7},
{5, 4}, {6, 3}, {7, 2}, {2, 7}, {3, 6}, {5, 4}, {6, 3}, {7, 2},
{3, 4}, {2, 3}, {1, 2}, {0, 1},
{3, 6}, {2, 7},
]) ])
assert Enum.sort(moves) == expected_moves assert Enum.sort(moves) == expected_moves
end end