changeset | 98be775c533c |
---|---|
branch | default |
bookmark | |
tag | tip |
user | IBBoard <dev@ibboard.co.uk> |
description | An odd "non-determinism" example from StackOverflow It is clever, but doesn't make much sense as to how it gets its results |
files | 7-Haskell/cointoss.hs |
changeset | d3e35dfc6f84 |
---|---|
branch | |
bookmark | |
tag | |
user | IBBoard <dev@ibboard.co.uk> |
description | Do some "have we been here via another route" filtering This (combined with simplified maze) means we solve the maze in under 10s! |
files | 7-Haskell/day3-maze.hs |
changeset | 1fae0cca1ef8 |
---|---|
branch | |
bookmark | |
tag | |
user | IBBoard <dev@ibboard.co.uk> |
description | Reduce large maze to single width corridors This reduces the permutations for a x x x b x To one (two steps north) from four (two steps north; one east, two north, one west; one east, one north, one west, one north; and one north, one east, one north, one west). Longer corridors were worse! We would filter this in the "been here before via another path" but that's still a lot of lookups in lists, which is inefficient. |
files | 7-Haskell/day3.maze |
changeset | 830140560f70 |
---|---|
branch | |
bookmark | |
tag | |
user | IBBoard <dev@ibboard.co.uk> |
description | First successful attempt at maze parsing and solving It struggles with large mazes (and ones with wide "paths") but it can solve the smaller cases. We skip in-route loops, but more optimisation is required to prune more routes and to use more efficient/Haskell-y methods. |
files | 7-Haskell/day3-maze.hs 7-Haskell/day3-simple.maze 7-Haskell/day3.maze |
changeset | 67631cb2ea48 |
---|---|
branch | |
bookmark | |
tag | |
user | IBBoard <dev@ibboard.co.uk> |
description | Expand the last note on getting into the monad state |
files | 7-Haskell/day3.hs |
changeset | 58f9c6e20f02 |
---|---|
branch | |
bookmark | |
tag | |
user | IBBoard <dev@ibboard.co.uk> |
description | Add a note about why we have to "Just" the input to our monad |
files | 7-Haskell/day3.hs |
changeset | 85a5e9a6ef5c |
---|---|
branch | |
bookmark | |
tag | |
user | IBBoard <dev@ibboard.co.uk> |
description | Add more notes on extracting Just/Maybe values |
files | 7-Haskell/day3.hs |
changeset | f548c8460d15 |
---|---|
branch | |
bookmark | |
tag | |
user | IBBoard <dev@ibboard.co.uk> |
description | Add extra note about monadic-ness |
files | 7-Haskell/day3.hs |
changeset | 83b4f23b9df8 |
---|---|
branch | |
bookmark | |
tag | |
user | IBBoard <dev@ibboard.co.uk> |
description | First successful attempt at a Haskell monad for hashtable lookup |
files | 7-Haskell/day3.hs |
changeset | eb868f089bd1 |
---|---|
branch | |
bookmark | |
tag | |
user | IBBoard <dev@ibboard.co.uk> |
description | Add notes and examples on data types and monads Still to do: Day 3 exercises |
files | 7-Haskell/README.txt 7-Haskell/monad.hs |