3 files changed, 26 insertions(+), 5 deletions(-)

M .nix/maze-escape.nix
M lib/Game/Maze/Data.hs
M maze-escape.cabal

@@ 1,9 1,9 @@
-{ mkDerivation, base, hspec, ilist, lib, mtl }:
+{ mkDerivation, base, hspec, ilist, lib, mtl, utility-ht }:
 mkDerivation {
   pname = "maze-escape";
   version = "0.1.0.0";
   src = ../.;
-  libraryHaskellDepends = [ base ilist mtl ];
+  libraryHaskellDepends = [ base ilist mtl utility-ht ];
   testHaskellDepends = [ base hspec ilist mtl ];
   homepage = "https://gitlab.com/Vonfry/maze-escape";
   license = lib.licenses.gpl3Plus;

@@ 1,10 1,18 @@
 {-# LANGUAGE MultiParamTypeClasses #-}
 {-# LANGUAGE FlexibleInstances #-}
+{-# LANGUAGE MultiWayIf #-}
 
-module Game.Maze.Data where
+module Game.Maze.Data
+  ( MazeCell(..)
+  , MazeMapList(..)
+  , MazeMapListPos
+  )
+where
 
 import Game.Maze
 import Data.List.Index (ifoldr)
+import Control.Monad (unless)
+import Data.Monoid.HT (when)
 
 data MazeCell = S -- ^ source
               | D -- ^ destination


@@ 21,8 29,20 @@ instance MovableCell MazeCell where
   movable _ = True
 
 instance Maze2D MazeMapList MazeMapListPos MazeCell where
-  -- | assume the map is a matrix istead of atactic one.
-  adjacence map pos = [] -- TODO
+  adjacence (MazeMapList cells) (x, y) =
+    withUp <> withDown <> withLeft <> withRight
+      where
+        withUp = when (y > 0) $ pure up
+        withDown = when (y < lcol - 1) $ pure down
+        withLeft = when (x > 0) $ pure left
+        withRight = when (x < lrow - 1) $ pure right
+        row = cells !! x
+        lrow = length row
+        lcol = length cells
+        up    = (x, y - 1)
+        down  = (x, y + 1)
+        left  = (x - 1, y)
+        right = (x + 1, y)
 
   getCell (MazeMapList cells) (x,y) = cells !! x !! y
 

@@ 22,6 22,7 @@ common deps
     build-depends:    base ==4.*
                     , mtl
                     , ilist
+                    , utility-ht
 
 library
     import:           deps