{"request":{"endpoint":"https://exercism.org/api/v2/tracks/unison/exercises/queen-attack/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"d023a1c4576e45989ef859358fabdf6a","snippet":"queenAttack.create : (Nat,Nat) -> {Abort} (Nat,Nat) queenAttack.create = cases (file, rank) | file > 7 || (rank > 7) -> abort position -> position queenAttack.canAttack : (Nat,Nat) -> (Nat,Nat) -> {Abort} Boolean queenAttack.canAttack = cases (file1, rank1), (file2, rank2) -> file1 == file2 || (rank1 == rank2) || (diff file1 file2 == diff rank1 rank2) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":3,"num_loc":7,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-07-20T08:42:51.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"david82"},"exercise":{"title":"Επίθεση βασίλισσας","icon_url":"https://assets.exercism.org/exercises/queen-attack.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/solutions/david82","private_iterations_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/iterations"}},{"uuid":"a4db8cc4b1624aef89e3fd37ac6b5cef","snippet":"queenAttack.create : (Nat,Nat) -> {Abort} (Nat,Nat) queenAttack.create = cases c | at1 c < 8 && (at2 c < 8) -> c _ -> abort queenAttack.canAttack : (Nat,Nat) -> (Nat,Nat) -> {Abort} Boolean queenAttack.canAttack whiteQueen blackQueen = match Nat.toInt (at1 whiteQueen) - (Nat.toInt (at1 blackQueen)) == +0 || (Nat.toInt (at2 whiteQueen) - (Nat.toInt (at2 blackQueen)) == +0) with true -> true ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-09-05T20:16:15.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"marcobonifacio"},"exercise":{"title":"Επίθεση βασίλισσας","icon_url":"https://assets.exercism.org/exercises/queen-attack.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/solutions/marcobonifacio","private_iterations_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/iterations"}},{"uuid":"dee704b4bb1e4e61af5e2c4cc56d960a","snippet":"create : (Nat,Nat) -> {Abort} (Nat,Nat) create = cases (x,y) | x > 7 || (y > 7) -> abort p -> p canAttack : (Nat,Nat) -> (Nat,Nat) -> {Abort} Boolean canAttack = cases (x1,y1), (x2,y2) -> x1 == x2 || (y1 == y2) || (diff x1 x2 == diff y1 y2) ","num_views":0,"num_stars":2,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":7,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-06-30T03:19:32.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"runarorama"},"exercise":{"title":"Επίθεση βασίλισσας","icon_url":"https://assets.exercism.org/exercises/queen-attack.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/solutions/runarorama","private_iterations_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/iterations"}},{"uuid":"a52176fad6fe4378a137e4bf1b1af7f4","snippet":"queenAttack.create : (Nat,Nat) -> {Abort} (Nat,Nat) queenAttack.create = cases (x, y) | (x >= 8) || (y >= 8) -> abort | otherwise -> (x, y) queenAttack.canAttack : (Nat,Nat) -> (Nat,Nat) -> {Abort} Boolean queenAttack.canAttack = cases (x1, y1), (x2, y2) | (x1 == x2) || (y1 == y2) -> true | (diff x1 x2) == (diff y1 y2) -> true ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":10,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-01-30T14:42:19.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"NegiGreenWhite"},"exercise":{"title":"Επίθεση βασίλισσας","icon_url":"https://assets.exercism.org/exercises/queen-attack.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/solutions/NegiGreenWhite","private_iterations_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/iterations"}},{"uuid":"b04e978d90e34efd85292eda54394168","snippet":"queenAttack.create : (Nat,Nat) -> {Abort} (Nat,Nat) queenAttack.create = cases (row, col) | row < 8 && col < 8 -> (row, col) _ -> abort queenAttack.canAttack : (Nat,Nat) -> (Nat,Nat) -> {Abort} Boolean queenAttack.canAttack whiteQueen blackQueen = match (create whiteQueen, create blackQueen) with ((wRow, _), (bRow, _)) | wRow == bRow -> true ((_, wCol), (_, bCol)) | wCol == bCol -> true ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-08-22T10:34:01.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"OldIronHorse"},"exercise":{"title":"Επίθεση βασίλισσας","icon_url":"https://assets.exercism.org/exercises/queen-attack.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/solutions/OldIronHorse","private_iterations_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/iterations"}},{"uuid":"2b41b6996f7e42fda4144bd206c38861","snippet":"create : (Nat,Nat) -> {Abort} (Nat,Nat) create = cases (c, r) | (c < 8) && (r < 8) -> (c, r) _ -> abort sameRow : (Nat, Nat) -> (Nat, Nat) -> Boolean sameRow = cases (r1, _), (r2, _) -> r1 == r2 sameColumn : (Nat, Nat) -> (Nat, Nat) -> Boolean ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":19,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"errored","published_at":"2022-06-23T18:53:01.000Z","is_out_of_date":true,"language":"haskell","author":{"handle":"ceedubs"},"exercise":{"title":"Επίθεση βασίλισσας","icon_url":"https://assets.exercism.org/exercises/queen-attack.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/solutions/ceedubs","private_iterations_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/iterations"}},{"uuid":"c4141c7c1ffb433dbc89ef4adc2bc3cb","snippet":"queenAttack.create : (Nat,Nat) -> {Abort} (Nat,Nat) queenAttack.create = cases (x, y) | (x < 8) && (y < 8) -> (x, y) _ -> abort queenAttack.canAttack: (Nat,Nat) -> (Nat,Nat) -> {Abort} Boolean queenAttack.canAttack whiteQueen blackQueen = match (create whiteQueen, create blackQueen) with ((x1, y1), (x2, y2)) | x1 == x2 -> true | y1 == y2 -> true ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-01-23T20:00:06.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"gfinol"},"exercise":{"title":"Επίθεση βασίλισσας","icon_url":"https://assets.exercism.org/exercises/queen-attack.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/solutions/gfinol","private_iterations_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/iterations"}},{"uuid":"8bcf5a2f481341d9a291bd7f796df6aa","snippet":"queenAttack.create : (Nat,Nat) -> {Abort} (Nat,Nat) queenAttack.create coordinates = match coordinates with (x,y) | (x < 8 ) && (y < 8) -> (x,y) _ -> abort queenAttack.canAttack : (Nat,Nat) -> (Nat,Nat) -> {Abort} Boolean queenAttack.canAttack whiteQ blackQ = whiteQueen = create whiteQ ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":19,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-06-30T10:30:05.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"JAL"},"exercise":{"title":"Επίθεση βασίλισσας","icon_url":"https://assets.exercism.org/exercises/queen-attack.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/solutions/JAL","private_iterations_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/iterations"}},{"uuid":"b53ea60e0798422f8519cea3bcc865c0","snippet":"queenAttack.create : (Nat,Nat) -> {Abort} (Nat,Nat) queenAttack.create = cases (a, b) | (a < 8) && (b < 8) -> (a, b) -> abort queenAttack.canAttack : (Nat,Nat) -> (Nat,Nat) -> {Abort} Boolean queenAttack.canAttack = cases ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"errored","published_at":"2023-04-20T00:45:06.000Z","is_out_of_date":true,"language":"haskell","author":{"handle":"gdbaldw"},"exercise":{"title":"Επίθεση βασίλισσας","icon_url":"https://assets.exercism.org/exercises/queen-attack.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/solutions/gdbaldw","private_iterations_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/iterations"}},{"uuid":"2d6c0745f10242ffbf6b75638926e103","snippet":"queenAttack.create : (Nat,Nat) -> {Abort} (Nat,Nat) queenAttack.create = Function.tap (cases (a,b) -> (a > 7) || (b > 7) |> abortWhen) queenAttack.canAttack : (Nat,Nat) -> (Nat,Nat) -> {Abort} Boolean queenAttack.canAttack = cases pos1, pos2 | pos1 === pos2 -> abort (x1,y1), (x2,y2) -> (x1 == x2) || (y1 == y2) || (diff x1 x2 == diff y1 y2) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":6,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-05-16T13:31:24.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"dreig"},"exercise":{"title":"Επίθεση βασίλισσας","icon_url":"https://assets.exercism.org/exercises/queen-attack.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/solutions/dreig","private_iterations_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/iterations"}},{"uuid":"cfc22b7fb40e4856b4cbc58c636b40ee","snippet":"queenAttack.create : (Nat,Nat) -> {Abort} (Nat,Nat) queenAttack.create = cases coor@(x, y) | x > 7 || (y > 7) -> abort | otherwise -> coor queenAttack.canAttack : (Nat,Nat) -> (Nat,Nat) -> {Abort} Boolean queenAttack.canAttack whiteQueen blackQueen = (x1, y1) = create whiteQueen (x2, y2) = create blackQueen ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-10-09T07:19:26.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"autf"},"exercise":{"title":"Επίθεση βασίλισσας","icon_url":"https://assets.exercism.org/exercises/queen-attack.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/solutions/autf","private_iterations_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/iterations"}},{"uuid":"3567c32de5644a8e8200c646853f5cb3","snippet":"queenAttack.create : (Nat,Nat) -> {Abort} (Nat,Nat) queenAttack.create coordinates = (x,y) = coordinates if x <= 7 && y <= 7 then (x,y) else abort queenAttack.canAttack : (Nat,Nat) -> (Nat,Nat) -> Boolean queenAttack.canAttack whiteQueen blackQueen = (wr, wc) = whiteQueen (br, bc) = blackQueen toInt = Int.fromRepresentation ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-03-04T21:42:26.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"metaxis"},"exercise":{"title":"Επίθεση βασίλισσας","icon_url":"https://assets.exercism.org/exercises/queen-attack.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/solutions/metaxis","private_iterations_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/iterations"}},{"uuid":"9f70b1c2318243cd90f32803001d995f","snippet":"queenAttack.create : (Nat,Nat) -> {Abort} (Nat,Nat) queenAttack.create = cases (x, y) | x >= 0 && x < 8 && y >= 0 && y < 8 -> (x, y) | otherwise -> abort queenAttack.canAttack : (Nat,Nat) -> (Nat,Nat) -> {Abort} Boolean queenAttack.canAttack whiteQueen blackQueen = match [whiteQueen, blackQueen] with [(a,b),(c, d)] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-08-10T06:54:23.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"rxt30-1255"},"exercise":{"title":"Επίθεση βασίλισσας","icon_url":"https://assets.exercism.org/exercises/queen-attack.svg"},"track":{"title":"Unison","icon_url":"https://assets.exercism.org/tracks/unison.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/solutions/rxt30-1255","private_iterations_url":"https://exercism.org/el/tracks/unison/exercises/queen-attack/iterations"}}],"meta":{"current_page":1,"total_count":13,"total_pages":1,"unscoped_total":13}}}}}

Γλώσσες προγραμματισμού

Μάθε προγραμματισμό με το Jiki

Το Ταξίδι σου

Τα Αγαπημένα σουΝέο

Προνόμια του Exercism

Βίντεο της Κοινότητας

Σειρά σύντομων εισαγωγών

Συνεντεύξεις και ιστορίες

Discord

Φόρουμ

Ξεκινώντας

Καθοδήγηση

Τεκμηρίωση

Συνεισφέροντες

ΜεταφραστέςΝέο

Κάνε δωρεά

Σχετικά με το Exercism

Ο αντίκτυπός μας

Συγχρονισμός GitHubΝέο

Insiders