Objective

Write a program that draws an initial grid from commands, then simulates a cellular life board.

Steps

• Create life_board_draw.c.
• The program is called as ./life_board_draw width height iterations.
• width, height, and iterations are non-negative decimal integers; width and height must be greater than zero.
• Read drawing commands from standard input until EOF.
• The drawing cursor starts at row 0, column 0 with the pen lifted.
• p toggles the pen. When the pen becomes lowered, the current cell becomes alive.
• u, d, l, and r move the cursor up, down, left, and right. Moves that would leave the board keep the cursor in place.
• When the pen is lowered, every visited cell becomes alive.
• Ignore any input character that is not one of the five drawing commands.
• After reading stdin, apply the standard neighbor-count life rules for the requested number of iterations.
• A live cell survives with two or three live neighbors; a dead cell becomes live with exactly three live neighbors.
• Cells outside the board are always dead.
• Print the final board using @ for live cells and . for dead cells, one row per line.
• Return 1 for invalid arguments or wrong argument count.

Objective

Write a program that draws an initial grid from commands, then simulates a cellular life board.

Steps

• Create life_board_draw.c.
• The program is called as ./life_board_draw width height iterations.
• width, height, and iterations are non-negative decimal integers; width and height must be greater than zero.
• Read drawing commands from standard input until EOF.
• The drawing cursor starts at row 0, column 0 with the pen lifted.
• p toggles the pen. When the pen becomes lowered, the current cell becomes alive.
• u, d, l, and r move the cursor up, down, left, and right. Moves that would leave the board keep the cursor in place.
• When the pen is lowered, every visited cell becomes alive.
• Ignore any input character that is not one of the five drawing commands.
• After reading stdin, apply the standard neighbor-count life rules for the requested number of iterations.
• A live cell survives with two or three live neighbors; a dead cell becomes live with exactly three live neighbors.
• Cells outside the board are always dead.
• Print the final board using @ for live cells and . for dead cells, one row per line.
• Return 1 for invalid arguments or wrong argument count.