Tenner Grid is a Mathematical puzzle that consists of a rectangular grid of width ten cells. assuming you have an empty grid, except for the cells in the last row are already given, The task is to fill in the grid so that each row contains the numbers 0 to 9. Numbers must not be repeated in rows. In columns the numbers may be repeated and the numbers in a column must add up to a given target sum. Therefore, the bottom numbers give the sum of the numbers in column. The digits in contiguous cells (even diagonally contiguous cells) must be different:

Write an AI program to generate and solve the game Tenner Grid by modelling it as constraint satisfaction problem.

So,I need a code for a boolean method that checks if the last cell in a column is the sum for all the other cells in that particular column .

implemented in java