The game consists of a 7x7 board of which 10 of those 49 slots are “stars”. The objective of the game is to determine the position of these stars. To help with identifying the correct position, some slots contain hints in the form of numbers. These hints work like the number hints in minesweeper in the sense that it identifies how many stars are adjacent to the slot. The range of values are from 0 (no stars) to 8 (fully surrounded by stars). A Tentaizu puzzle contains only these number hints. Much like other puzzle games like sudoku, there is only one combination of star positions that is described by the puzzle. 2. Your task is to create a solver function for a given Tentaizu puzzle. This function should be able to recursively solve the puzzle. Define a function “solve” with the input variable being a 7x7 list representing the Tentaizu puzzle. The return value should be a list of tuples containing the correct coordinates of the 10 stars. If there is no valid solution, it should return an empty list instead. [] = solve(puzzle) input = [['1', '.', '.', '.', '.', '3', '.'], ['.', '.', '.', '.', '.', '.', '.'], ['.', '1', '.', '.', '0', '.', '.'], ['.', '.', '.', '2', '.', '.', '.'], ['.', '3', '.', '.', '.', '.', '3'], ['.', '.', '.', '.', '1', '.', '.'], ['.', '.', '.', '1', '.', '.', '1']] solution = {(0, 1), (0, 4), (1, 6), (3, 2), (3, 6), (4, 5), (5, 2), (4, 2), (0, 6), (5, 6)}
. The game consists of a 7x7 board of which 10 of those 49 slots are “stars”. The
objective of the game is to determine the position of these stars. To help with
identifying the correct position, some slots contain hints in the form of numbers.
These hints work like the number hints in minesweeper in the sense that it
identifies how many stars are adjacent to the slot. The range of values are from
0 (no stars) to 8 (fully surrounded by stars). A Tentaizu puzzle contains only these
number hints. Much like other puzzle games like sudoku, there is only one
combination of star positions that is described by the puzzle.
2. Your task is to create a solver function for a given Tentaizu puzzle. This function
should be able to recursively solve the puzzle. Define a function “solve” with the
input variable being a 7x7 list representing the Tentaizu puzzle. The return value
should be a list of tuples containing the correct coordinates of the 10 stars. If
there is no valid solution, it should return an empty list instead.
[] = solve(puzzle)
input = [['1', '.', '.', '.', '.', '3', '.'], ['.', '.', '.', '.', '.', '.', '.'], ['.', '1', '.', '.', '0', '.', '.'], ['.', '.', '.', '2', '.', '.', '.'], ['.', '3', '.', '.', '.', '.', '3'], ['.', '.', '.', '.', '1', '.', '.'], ['.', '.', '.', '1', '.', '.', '1']]
solution = {(0, 1), (0, 4), (1, 6), (3, 2), (3, 6), (4, 5), (5, 2), (4, 2), (0, 6), (5, 6)}
Step by step
Solved in 3 steps
