Have I made a good decision or is Prolog not a good choice? I wanted to use this problem as a learning exercise in prolog, I think it seems like a problem Prolog will solve elegantly. (Knowing also that all of these numbers are integers which are ≥0). I can find out what all the a, b, variables are by solving this system of equations: So the grid will have to resemble that ^^ I am thinking I can use tuple-like arguments to the function.Īnd then every 'cell' or card in the grid is itself a tuple, the first element of the tuple will be the score of the card there (or 0 if it is a black spot) and the second element will be a 1 if the card is a black spot or a 0 otherwise. Now I want to make a function that inputs the given information and produces the grid of cards that satisfies those constraints. Of course we can see the above grid will 'solve' to

The rightmost column must have a sum score of 2, and exactly one of the cards is a black spot.

So the top row must have a sum score of 1, and exactly one of the cards is a black spot. I am given the information of the sum of the scores of each row, the number of black spots in each row, and the sum of the scores of each column, and the number of black spots in each column. positive non-zero integer, representing the card's 'score'.The cards are all face down, and printed on the faces of the cards are either a: I have cards laid out in a grid, I am starting with a simple case of a 2x2 grid but want to be able to extrapolate to larger n×n grids eventually. It's something I want to solve for a personal project. I realise I've written this like a homework question, but that's because it's the simplest way for me to understand and try to relay the problem.

Simple minesweeper game in prolog