FP Homework 1/en - Revision history

FuzzyBot: Updating to match new version of source page

2022-10-07T10:07:22Z

Updating to match new version of source page

FuzzyBot: Updating to match new version of source page

2021-10-07T09:45:07Z

Updating to match new version of source page

FuzzyBot: Updating to match new version of source page

2020-11-18T10:38:00Z

Updating to match new version of source page

FuzzyBot: Updating to match new version of source page

2020-11-10T11:22:09Z

Updating to match new version of source page

FuzzyBot: Updating to match new version of source page

2020-11-10T10:21:53Z

Updating to match new version of source page

FuzzyBot: Updating to match new version of source page

2019-11-06T14:36:41Z

Updating to match new version of source page

FuzzyBot: Updating to match new version of source page

2019-11-05T10:41:17Z

Updating to match new version of source page

FuzzyBot: Updating to match new version of source page

2019-10-21T15:42:59Z

Updating to match new version of source page

New page

== Basic notes ==

In all exercises you are required to write something to standard output. You can use the same strategy as in [[FP_Laboratory_7 | Laboratory 7]].

Lets define a type for the result:
<syntaxhighlight lang="Haskell">type Result = [String]</syntaxhighlight>
Now, if you want to print this result nicely on the screen, you can use:
<syntaxhighlight lang="Haskell">
pp :: Result -> IO ()
pp x = putStr (concat (map (++"\n") x))
</syntaxhighlight>
== 1 - Chess position ==

Implement the function <code>chess</code> which has 2 arguments of the type <code>[String]</code>. Each of these strings in both lists contain 3 characters:
* first stands for chess piece ('K' - king, 'Q' - queen, 'R' - rook, 'B' - bishop, 'N' - knight, 'P' - pawn)
* second stands for column ('a'-'h')
* third is row ('1'-'8')
First list contains actual positions of white pieces and second list positions of black pieces. Print actual state of a chessboard in the way where '.' stands for empty square, capital letters mean white pieces and small letters mean black pieces. Each row and column should be labeled by its number or letter.
<syntaxhighlight lang="Haskell">
chess :: String -> String -> Result
</syntaxhighlight>

<syntaxhighlight lang="Haskell" class="myDark" >
Prelude> pp( chess["Ke1","Ra1","Rh1","Pa2","Be5"] ["Ke8","Ra8","Rh8","Pa7","Qd8","Bc8","Nb8"])
8rnbqk..r
7p.......
6........
5....B...
4........
3........
2P.......
1R...K..R
abcdefgh
</syntaxhighlight>
== 2 - Ticktacktoe ==

Implement the function <code>ticktack</code> which has 2 arguments. First argument is a tuple of natural numbers and defines the number of rows and columns of a play field. Second list contains a record of a match of ticktacktoe game given by coordinates on which played in turns player 'x' and player 'o'. Print actual state of the game in the way where play-field will be bordered by characters '-' and '|', empty squares ' ' and characters 'x' and 'o' will be on squares where the players have played.
<syntaxhighlight lang="Haskell">
ticktack::(Int,Int) -> [(Int,Int)] -> Result
</syntaxhighlight>
<syntaxhighlight lang="Haskell" class="myDark" >
Prelude>pp( ticktack (8,8) [(1,1),(8,8),(2,2,)(3,3)(4,2)(3,2)])
----------
| o|
| |
| |
| |
| |
| o |
| xox |
|x |
----------
</syntaxhighlight>

== 3 - Maze ==

Implement the function <code>maze</code> which has 2 arguments. First argument is a list of strings representing a maze row by row from top to bottom ('*' - wall, ' ' - empty square, 's' - starting position). At the beginning we are at position 's'. Second argument is list of directions ('d' - down, 'u' - up, 'l' - left, 'r' - right). Each letter means move by one square in the given direction and on this new square character '.' is placed. Print actual state of a maze.
<syntaxhighlight lang="Haskell">
maze :: Result -> String -> Result

sampleInput = ["*********",
"*s* * *",
"* * * * *",
"* * * * *",
"* * *",
"******* *",
" *",
"*********"]
</syntaxhighlight>
<syntaxhighlight lang="Haskell" class="myDark" >
Prelude>pp(maze sampleInput "dddrruuurrdddrrddllllll")
*********
*s*...* *
*.*.*.* *
*.*.*.* *
*...*...*
*******.*
.......*
*********
</syntaxhighlight>

== 4 - Minesweeper ==

Implement the function <code>minesweeper</code> which has 1 argument of the type list of strings. The strings represent play field row by row from top to bottom ('*' - mine, ' ' - empty square). Print play field in a way where mines will be represented by '*' and on each square not containing a mine will be a number - count of all mines directly adjacent to this square (it can be adjacent vertically, horizontally or diagonally).
<syntaxhighlight lang="Haskell">
minesweeper :: Result -> Result
sampleInput = [" ",
" * ",
" * ",
" * ",
" *",
"*** ",
"* * ",
"*** "]
</syntaxhighlight>
<syntaxhighlight lang="Haskell" class="myDark" >
Prelude>pp(minesweeper sampleInput)
1110000
1*11110
1122*10
001*221
233211*
***2011
*8*3000
***2000
</syntaxhighlight>

== 5 - Ships ==

Implement the function <code>ships</code> which has 2 arguments. First argument is a list of strings representing play field of one player row by row from top to bottom ('o' - square containing a ship, ' ' - empty square). Second list contains coordinates of squares attacked by second player. Print actual state of a play in the way where every row and column will be labelled by its number or letter, 'o' will be square with ship not attacked yet, 'x' square with ship already attacked, '.' already attacked empty square, ' ' empty square not attacked yet. You can consider that the size of play-field is 10x10.
<syntaxhighlight lang="Haskell">
ships :: Result -> [(Char, Int)] -> Result
sampleInput = [" o o ",
" ooo ",
" oo ",
" ",
" ",
" o ",
" o ",
" o ",
" ",
" ",
" oooo "]
</syntaxhighlight>
<syntaxhighlight lang="Haskell" class="myDark" >
Prelude>pp(ships sampleInput [('a',1),('d',1),('d',2),('c',1),('b',1),('e',1),('f',1),('g',1),('c',7),('c',10)])
10 x o
9 ooo
8 oo
7 .
6
5 o
4 o
4 o
3
2 .
1..xxxx.
abcdefghij
</syntaxhighlight>

@@ Line 79: / Line 79: @@
 <div style="clear:both"></div>
 == 1 - Magic 15 Puzzle ==
@@ Line 186: / Line 185: @@
 </syntaxhighlight>
-= 2020/2021 Homeworks =
+== 6 - Chess position ==
 Implement the function <code>chess</code> which has 2 arguments of the type <code>[String]</code>. Each of these strings in both lists contain 3 characters:
@@ Line 211: / Line 208: @@
   abcdefgh
 </syntaxhighlight>
-== 2 - Ticktacktoe ==
+== 7 - Ticktacktoe ==
 Implement the function <code>ticktack</code> which has 2 arguments. First argument is a tuple of natural numbers and defines the number of columns and rows  of a play field. Coordinates are counted from bottom left corner. Second list contains a record of a match of ticktacktoe game given by coordinates on which played in turns player 'x' and player 'o'. Print actual state of the game in the way where play-field will be bordered by characters '-' and '|', empty squares ' ' and characters 'x' and 'o' will be on squares where the players have played.
@@ Line 231: / Line 228: @@
 </syntaxhighlight>
-== 3 - Maze ==
+== 8 - Maze ==
 Implement the function <code>maze</code> which has 2 arguments. First argument is a list of strings representing a maze row by row from top to bottom ('*' - wall, ' ' - empty square, 's' - starting position). At the beginning we are at position 's'. Second argument is list of directions ('d' - down, 'u' - up, 'l' - left, 'r' - right). Each letter means move by one square in the given direction and on this new square character '.' is placed. Print actual state of a maze.
@@ Line 258: / Line 255: @@
 </syntaxhighlight>
-== 4 - Minesweeper ==
+== 9 - Minesweeper ==
 Implement the function <code>minesweeper</code> which has 1 argument of the type list of strings. The strings represent play field row by row from top to bottom ('*' - mine, ' ' - empty square). Print play field in a way where mines will be represented by '*' and on each square not containing a mine will be a number - count of all mines directly adjacent to this square (it can be adjacent vertically, horizontally or diagonally).
@@ Line 284: / Line 281: @@
 </syntaxhighlight>
-== 5 - Turtle ==
+== 10 - Turtle ==
 Implement a function that will draw the movement of a turtle in a rectangular grid. It will be named <code>draw</code> and it will have one parameter - a list movements. Our turtle can move only horizontally or vertically. Each movement will be described by a pair (its type will be <code>(Char, Int)</code>), where the first character denotates a direction of this movement and the second its length. Possible directions are: <b>l</b>eft, <b>r</b>ight, <b>u</b>p, and <b>d</b>own. As the result, function <code>draw</code> returns a smallest possible rectangle with all turtle's movements. Each block from the grid will be represented with one character. If it was visited by our turtle, then it will be <code>'X'</code>, if it was not, then it will be <code>' '</code>.

@@ Line 79: / Line 79: @@
 <div style="clear:both"></div>
 == 1 - Chess position ==
@@ Line 177: / Line 284: @@
 </syntaxhighlight>
 == 5 - Turtle ==
 Implement a function that will draw the movement of a turtle in a rectangular grid. It will be named <code>draw</code> and it will have one parameter - a list movements. Our turtle can move only horizontally or vertically. Each movement will be described by a pair (its type will be <code>(Char, Int)</code>), where the first character denotates a direction of this movement and the second its length. Possible directions are: <b>l</b>eft, <b>r</b>ight, <b>u</b>p, and <b>d</b>own. As the result, function <code>draw</code> returns a smallest possible rectangle with all turtle's movements. Each block from the grid will be represented with one character. If it was visited by our turtle, then it will be <code>'X'</code>, if it was not, then it will be <code>' '</code>.

@@ Line 10: / Line 10: @@
 pp x = putStr (concat (map (++"\n") x))
 </syntaxhighlight>
 == 1 - Chess position ==
@@ Line 35: / Line 106: @@
 == 2 - Ticktacktoe ==
-Implement the function <code>ticktack</code> which has 2 arguments. First argument is a tuple of natural numbers and defines the number of columns and rows of a play field. Coordinates are counted from bottom left corner. Second list contains a record of a match of ticktacktoe game given by coordinates on which played in turns player 'x' and player 'o'. Print actual state of the game in the way where play-field will be bordered by characters '-' and '|', empty squares ' ' and characters 'x' and 'o' will be on squares where the players have played.
+Implement the function <code>ticktack</code> which has 2 arguments. First argument is a tuple of natural numbers and defines the number of columns and rows  of a play field. Coordinates are counted from bottom left corner. Second list contains a record of a match of ticktacktoe game given by coordinates on which played in turns player 'x' and player 'o'. Print actual state of the game in the way where play-field will be bordered by characters '-' and '|', empty squares ' ' and characters 'x' and 'o' will be on squares where the players have played.
 <syntaxhighlight lang="Haskell">
 ticktack::(Int,Int) -> [(Int,Int)] -> Result
@@ Line 106: / Line 177: @@
 </syntaxhighlight>
-== 5 - Ships ==
+== 5 - Turtle ==
 <syntaxhighlight lang="Haskell">
-ships :: Result -> [(Char, Int)] -> Result
+draw :: [(Char, Int)] -> Result
 </syntaxhighlight>
 <syntaxhighlight lang="Haskell" class="myDark" >
-Prelude>pp(ships sampleInput [('a',1),('d',1),('d',2),('c',1),('b',1),('e',1),('f',1),('g',1),('c',7),('c',10)])
+*Main> pp (draw [('u',5),('r',5),('d',5),('l',10),('d',5),('r',5),('u',5)])
-  x    o
+     XXXXXX
-     ooo
+     X    X
-   oo
+      X    X
-  .
+     X    X
-     o
+     X    X
-     o
+XXXXXXXXXXX
-     o
+X    X
+X    X
-   .
+X    X
-..xxxx.
+X    X
-   abcdefghij
+XXXXXX
 </syntaxhighlight>

@@ Line 18: / Line 18: @@
 First list contains actual positions of white pieces and second list positions of black pieces. Print actual state of a chessboard in the way where '.' stands for empty square, capital letters mean white pieces and small letters mean black pieces. Each row and column should be labeled by its number or letter.
 <syntaxhighlight lang="Haskell">
-chess :: String -> String -> Result
+chess :: [String] -> [String] -> Result
 </syntaxhighlight>
@@ Line 114: / Line 114: @@
                 "      ooo ",
                 "   oo     ",
                 "          ",
                 "     o    ",
@@ Line 125: / Line 124: @@
 <syntaxhighlight lang="Haskell" class="myDark" >
 Prelude>pp(ships sampleInput [('a',1),('d',1),('d',2),('c',1),('b',1),('e',1),('f',1),('g',1),('c',7),('c',10)])
   x    o
       ooo
    oo
   .
+     o
     o
-    o
+     o
-     o
+   .
-   .
+..xxxx.
-..xxxx.
+   abcdefghij
 </syntaxhighlight>

@@ Line 40: / Line 40: @@
 </syntaxhighlight>
 <syntaxhighlight lang="Haskell" class="myDark" >
-Prelude>pp( ticktack (8,8) [(1,1),(8,8),(2,2,)(3,3)(4,2)(3,2)])
+Prelude>pp(ticktack (8,8) [(1,1),(8,8),(2,2),(3,3),(4,2),(3,2)])
 ----------
 |       o|