{"request":{"endpoint":"https://exercism.org/api/v2/tracks/haskell/exercises/game-of-life/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"be6cfa7bae734cf5806e6ebb69e635b4","snippet":"module GameOfLife (tick) where import Data.List tick :: [[Int]] -> [[Int]] tick = map (map conway) . windows33 . padzerolist conway :: [Int] -> Int conway x | total == 3 = 1 | total == 4 = fromEnum $ x!!4 == 1 ","num_views":0,"num_stars":2,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":17,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2024-04-29T23:18:37.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"ericyuxuanye"},"exercise":{"title":"जीवन का खेल","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/solutions/ericyuxuanye","private_iterations_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/iterations"}},{"uuid":"6c6e3585b21e4c25b03fb8bcc3666d5a","snippet":"module GameOfLife (tick) where tick :: [[Int]] -> [[Int]] tick board = [ [ nextState x y | x <- [0..w-1] ] | y <- [0..h-1] ] where h = length board w = if null board then 0 else length (head board) nextState x y = case (get x y, countLiveNeighbors x y) of ","num_views":0,"num_stars":2,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":16,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-06-20T13:24:04.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"Zielknz"},"exercise":{"title":"जीवन का खेल","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/solutions/Zielknz","private_iterations_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/iterations"}},{"uuid":"06a8db11430c4610be23e4952b86a28e","snippet":"module GameOfLife (tick) where tick :: [[Int]] -> [[Int]] tick [] = [] tick a = a000 where count ((a, b, c), (d, e, f), (h, g, i)) = (e, a+b+c+d+f+h+g+i) alive (1, 2) = 1 alive (_, 3) = 1 ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":16,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2024-06-22T11:51:41.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"Vasya666"},"exercise":{"title":"जीवन का खेल","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/solutions/Vasya666","private_iterations_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/iterations"}},{"uuid":"284998b3799a445a884b4b895b0e2c01","snippet":"module GameOfLife (tick) where tick :: [[Int]] -> [[Int]] tick [] = [] tick cells = gridToLists $ grid (coordinatize cells) (neighbours cells) nbhd :: [(Int, Int)] nbhd = [(1,0), (1,1), (0,1), (-1,1), (-1,0), (-1,-1), (0,-1), (1,-1)] neighbours :: [[Int]] -> [((Int, Int), Int)] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":49,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-05-27T15:40:54.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"eppolito"},"exercise":{"title":"जीवन का खेल","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/solutions/eppolito","private_iterations_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/iterations"}},{"uuid":"f7359bc6590a4db59831af22a39edb01","snippet":"module GameOfLife (tick) where import Data.Bool (bool) tick :: [[Int]] -> [[Int]] tick board = map updateRow [0..(rowSize-1)] where rowSize = length board colSize = length $ board !! 0 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":23,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-05-31T16:41:31.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"sudhanshujoshi99"},"exercise":{"title":"जीवन का खेल","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/solutions/sudhanshujoshi99","private_iterations_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/iterations"}},{"uuid":"8f7e5cb99052486eb2b61084cf23361d","snippet":"module GameOfLife (tick) where tick :: [[Int]] -> [[Int]] tick board = [ [cell r c | c <- [0 .. length (board !! r) - 1]] | r <- [0 .. length board - 1] ] where cell r c | alive && (n == 2 || n == 3) = 1 -- Any live cell with two or three live neighbors lives on. ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":26,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-07-22T23:37:10.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"moniquelive"},"exercise":{"title":"जीवन का खेल","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/solutions/moniquelive","private_iterations_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/iterations"}},{"uuid":"f0aa0ee2116c4858b5bfe153bfd4ddeb","snippet":"module GameOfLife (tick) where tick :: [[Int]] -> [[Int]] tick list = [[lives ((list !! x) !! y) (neighbors x y list) | y<-[0..(length list -1)]] | x<-[0..(length list -1)]] where lives 1 n | n < 2 = 0 | n > 3 = 0 | otherwise = 1 lives 0 n | n == 3 = 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":16,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2024-08-05T21:33:14.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"david-kop"},"exercise":{"title":"जीवन का खेल","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/solutions/david-kop","private_iterations_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/iterations"}},{"uuid":"13455a2b447d4b909106e830501d75c4","snippet":"module GameOfLife (tick) where tick :: [[Int]] -> [[Int]] tick grid = [[nextState x y | y <- [0..width-1]] | x <- [0..height-1]] where height = length grid width = length (head grid) nextState x y = let alive = grid !! x !! y neighbors = countNeighbors x y ","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":"passed","published_at":"2024-05-23T20:16:11.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"robertmsale"},"exercise":{"title":"जीवन का खेल","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/solutions/robertmsale","private_iterations_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/iterations"}},{"uuid":"d3e8bfb9b74f40aeb25d3d921085f899","snippet":"module GameOfLife (tick) where import Data.List (transpose) tick :: [[Int]] -> [[Int]] tick matrix = zipWith (zipWith (\ns alive -> case alive of 1 -> if ns == 2 || ns == 3 then 1 else 0 0 -> if ns == 3 then 1 else 0)) neighbor_count matrix where n_cols = length $ head matrix ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-07-17T15:06:15.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"putintrump"},"exercise":{"title":"जीवन का खेल","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/solutions/putintrump","private_iterations_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/iterations"}},{"uuid":"6c26c79c5339443ea9d3ffa12b27ace5","snippet":"module GameOfLife (tick) where tick :: [[Int]] -> [[Int]] tick board = map (map tickCell) (twoDNeighborhoods board) type Neighborhood = ((Int, Int, Int), (Int, Int, Int), (Int, Int, Int)) consecutiveTriples :: [a] -> [(a, a, a)] consecutiveTriples (a : b : c : xs) = (a, b, c) : consecutiveTriples (b : c : xs) consecutiveTriples _ = [] -- length < 3 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":22,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-10-16T19:46:11.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"dfacoet"},"exercise":{"title":"जीवन का खेल","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/solutions/dfacoet","private_iterations_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/iterations"}},{"uuid":"f48eb039ff98422ab1a99336cb1fea5b","snippet":"module GameOfLife (tick) where import Control.Arrow import qualified Data.Map as Map import Data.Maybe type Pos = (Int, Int) type Grid a = Map.Map Pos a ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":29,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-10-19T15:38:47.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"kokotchY"},"exercise":{"title":"जीवन का खेल","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/solutions/kokotchY","private_iterations_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/iterations"}},{"uuid":"227ade558e0442e2ae7f1c42fbac738b","snippet":"module GameOfLife (tick) where tick :: [[Int]] -> [[Int]] tick world = [[nextState world i j | j <- [0..y]] | i <- [0..x]] where x = pred (length world) y = pred (length (head world)) getCell :: [[Int]] -> Int -> Int -> Int getCell world i j = if (i >= 0) && (i < length world) && (j >= 0) && (j < length (world !! i)) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-12-01T15:40:17.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"spacedome"},"exercise":{"title":"जीवन का खेल","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/solutions/spacedome","private_iterations_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/iterations"}},{"uuid":"7219033029cb41e6b0c9d9ae243ffabe","snippet":"module GameOfLife (tick) where import Data.List.Split (divvy) tick :: [[Int]] -> [[Int]] tick w = (map . map) (isAlive) (count w) isAlive :: (Int, Int) -> Int isAlive (state, n) | n == 3 = 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-01-17T21:15:26.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"bertvh"},"exercise":{"title":"जीवन का खेल","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/solutions/bertvh","private_iterations_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/iterations"}},{"uuid":"840c5b8baff74f57967a14c9b48f6e68","snippet":"module GameOfLife (tick) where tick :: [[Int]] -> [[Int]] tick [] = [] tick l | length l == 1 = evalCells [[sum ns | ns <- getNeighbours l]] l | length l == 2 = evalCells [[sum ns | ns <- row] | row <- [getNeighbours l, getNeighbours $ reverse l]] l | otherwise = let first = [getNeighbours [l!!0, l!!1]] middle = [getNeighbours [top, mid, bottom] | (top, mid, bottom) <- iterTriples l] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":31,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-11-06T13:15:30.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"NoahOpedal"},"exercise":{"title":"जीवन का खेल","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/solutions/NoahOpedal","private_iterations_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/iterations"}},{"uuid":"ba9692a253f445c0a03f97fe6a5361a6","snippet":"module GameOfLife (tick) where tick :: [[Int]] -> [[Int]] tick board = [[nextState r c | c <- [0..cols-1]] | r <- [0..rows-1]] where rows = length board cols = if rows == 0 then 0 else length (head board) nextState r c | isAlive r c = if neighbors `elem` [2,3] then 1 else 0 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":21,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2026-02-25T16:09:48.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"josueperea-432bc"},"exercise":{"title":"जीवन का खेल","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/solutions/josueperea-432bc","private_iterations_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/iterations"}},{"uuid":"be3e74e8f3d04b17b53c819efbfa2c89","snippet":"module GameOfLife (tick) where type Board = [[Int]] tick :: [[Int]] -> [[Int]] tick board = mapI (tickRow board) board tickRow :: Board -> [Int] -> Int -> [Int] tickRow board cells i = mapI tickCell cells where ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":26,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2024-04-20T23:14:17.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"jvcoutinho"},"exercise":{"title":"जीवन का खेल","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/solutions/jvcoutinho","private_iterations_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/iterations"}},{"uuid":"db97fdfe47f44cebadc86a685947ef58","snippet":"module GameOfLife (tick) where tick :: [[Int]] -> [[Int]] tick xs = zipWith (rows xs) xs [0 ..] rows :: [[Int]] -> [Int] -> Int -> [Int] rows xs s y = zipWith (cell xs y) s [0 ..] cell :: [[Int]] -> Int -> Int -> Int -> Int cell xs y 1 x = stayAlive $ countInRows y x xs - 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-04-30T06:06:17.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"RuedigerLudwig"},"exercise":{"title":"जीवन का खेल","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/solutions/RuedigerLudwig","private_iterations_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/iterations"}},{"uuid":"bddcc99bbba643c28abbbd4e30d4e541","snippet":"module GameOfLife (tick) where tick :: [[Int]] -> [[Int]] tick grid = [ [ nextState r c | c <- [0..cols-1] ] | r <- [0..rows-1] ] where rows = length grid cols = if null grid then 0 else length (head grid) getCell r c | r < 0 || c < 0 || r >= rows || c >= cols = 0 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":21,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-07-03T07:35:48.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"farrellshand"},"exercise":{"title":"जीवन का खेल","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/solutions/farrellshand","private_iterations_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/iterations"}},{"uuid":"3faa252a66ae4ee48623c7a49202af2b","snippet":"module GameOfLife (tick) where tick :: [[Int]] -> [[Int]] tick grid = [[next (cell i j) (neighbor i j) | j <- [0 .. cols - 1] ] | i <- [0..rows - 1]] where rows = length grid cols = length (head grid) cell i j = grid !! i !! j ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":16,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-07-03T08:03:41.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"nobuww"},"exercise":{"title":"जीवन का खेल","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/solutions/nobuww","private_iterations_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/iterations"}},{"uuid":"b8ea00e320b540e49cf586b880e4fbc8","snippet":"module GameOfLife (tick) where tick :: [[Int]] -> [[Int]] tick board = [ [ nextState x y | x <- [0..cols-1] ] | y <- [0..rows-1] ] where rows = length board cols = if null board then 0 else length (head board) get :: Int -> Int -> Int get x y ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":23,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-07-03T10:24:04.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"Falih26"},"exercise":{"title":"जीवन का खेल","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/solutions/Falih26","private_iterations_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/iterations"}},{"uuid":"5a916ab8db634791b23e9e06f7ae2c08","snippet":"module GameOfLife (tick) where -- | Compute the next generation of cells in Conway's Game of Life tick :: [[Int]] -> [[Int]] tick [] = [] tick matrix = [[nextCellState matrix row col | col <- [0..cols-1]] | row <- [0..rows-1]] where rows = length matrix cols = if rows > 0 then length (head matrix) else 0 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":30,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-06-10T17:43:25.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"VickMahase"},"exercise":{"title":"जीवन का खेल","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/solutions/VickMahase","private_iterations_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/iterations"}},{"uuid":"2b08c7a8e95b4adeaeb1b711863c16c0","snippet":"module GameOfLife (tick) where tick :: [[Int]] -> [[Int]] tick board = [ [ nextState r c | c <- [0..cols - 1] ] | r <- [0..rows - 1] ] where rows = length board cols = if rows == 0 then 0 else length (head board) getCell :: Int -> Int -> Int getCell r c ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":26,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-06-20T15:38:38.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"khalisazira"},"exercise":{"title":"जीवन का खेल","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/solutions/khalisazira","private_iterations_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/iterations"}},{"uuid":"00058789deb2405ba7a768c506a17a1b","snippet":"module GameOfLife (tick) where tick :: [[Int]] -> [[Int]] tick [] = [] tick board = [[f r c val | (c, val) <- zip [0..] row] | (r, row) <- zip [0..] board] where f r c x = let neighbors = liveCount r c in if neighbors == 3 || (x == 1 && neighbors == 2) then 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":19,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-09-14T18:27:30.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"colinmcnicholl"},"exercise":{"title":"जीवन का खेल","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/solutions/colinmcnicholl","private_iterations_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/iterations"}},{"uuid":"c7aaafc8b5f44b25bfca0b710fca43b1","snippet":"module GameOfLife (tick) where sLeft::[[Int]]->[[Int]] sLeft = map (\xs -> tail xs ++ [0]) sRight::[[Int]]->[[Int]] sRight = map (\xs -> 0:init xs) sUp::[[Int]]->[[Int]] sUp (x:xs) = xs ++ [replicate (length x) 0] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":19,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-03-24T02:44:52.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"aleemrtineez"},"exercise":{"title":"जीवन का खेल","icon_url":"https://assets.exercism.org/assets/graphics/missing-exercise-54cf5afe4add37d9cf717793c91b088a7dd242ef.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/solutions/aleemrtineez","private_iterations_url":"https://exercism.org/hi/tracks/haskell/exercises/game-of-life/iterations"}}],"meta":{"current_page":1,"total_count":177,"total_pages":8,"unscoped_total":177}}}}}

भाषा ट्रैक

Jiki के साथ कोड करना सीखिए

आपकी यात्रा

आपके पसंदीदानया

Exercism के खास फायदे

कम्युनिटी वीडियो

संक्षिप्त परिचय शृंखला

इंटरव्यू और कहानियाँ

Discord

फोरम

शुरुआत करें

मेंटर बनें

डॉक्स

योगदानकर्ता

अनुवादकनया

दान करें

Exercism के बारे में

हमारा प्रभाव

GitHub सिंकरनया

इनसाइडर्स