battleships game – Haskell [closed]

by

You need to transform the input grid into the output grid by mapping a function over each cell of the grid. The mapping function is going to need the coordinates of the cell and the content of the cell. The coordinates are needed to see if the other player fired at that location, and the contents are needed in order to know whether anything was hit.

Mapping can be done with map. Since the grid is 2d, you will need to map over the rows, and for each row, map over the columns of that row.

The coordinates of the row or column can be attached prior to mapping by zipping with an infinite .. range so that you get a pair of a coordinate in that dimension and a value in that dimension.

I.e.

zip [0..] xs

Labels each element of xs with a zero-based index.

You can test if a coordinate is a member of the shot list with elem.

More Related Contents:

  1. Haskell: Given a list of numbers and a number k, return whether any two numbers from the list add up to k
  2. What is the monomorphism restriction?
  3. Good examples of Not a Functor/Functor/Applicative/Monad?
  4. Monads with Join() instead of Bind()
  5. When is memoization automatic in GHC Haskell?
  6. How to get normal value from IO action in Haskell
  7. What does the “@” symbol mean in reference to lists in Haskell?
  8. New state of the art in unlimited generation of Hamming sequence
  9. How do you represent a graph in Haskell?
  10. Haskell types frustrating a simple ‘average’ function
  11. What’s the “|” for in a Haskell class definition?
  12. Lifting a higher order function in Haskell
  13. Distinction between typeclasses MonadPlus, Alternative, and Monoid?
  14. How do I write, “if typeclass a, then a is also an instance of b by this definition.”
  15. Function definition by special cases in GHCi
  16. Expressing do block using only monadic bind syntax
  17. Why do we need monads?
  18. Lambda for type expressions in Haskell?
  19. Pattern matching identical values
  20. Composing Monads v. Applicative Functors
  21. Abusing the algebra of algebraic data types – why does this work?
  22. What does the : infix operator do in Haskell?
  23. Monoidal Functor is Applicative but where is the Monoid typeclass in the definition of Applicative?
  24. How to return a pure value from a impure method
  25. How to convert Unicode Escape Sequence to Unicode String in Haskell
  26. Functional lenses
  27. functions as applicative functors (Haskell / LYAH)
  28. How to reuse a type variable in an inner type declaration
  29. How does Haskell printf work?
  30. Dot Operator in Haskell: need more explanation

Leave a Comment