Question on the sudoku solution on this website

Part A (Sudoku A)
B (Sudoku B)
C (Sudoku C)

this question refers to the Sudoku howto posted on this website. The links are shown above. My question centers around the boolean variables declared in
Part A, such as the following.

if the boolean values are just declared like that, how would that serve the purposes of checking whether the value is present in a row, as done in
the method "possible", shown below?

suppose the values 1,1,7 was passed to the method 'possible.'

it would first check rows[1][7], right? and that would yield true or false.
now...rows[1][7] has not been declared true or false. How would the method
at that point know anything about the first row? in fact, how do these boolean
values know to refer to the actual sudoku board, int board[][], since these
rows[][], columns[][], and squares[][], are boolean values of their own, completely unrelated to the sudoku board int values, board[][]?

perhaps I just don't understand how this "possible" method works.
any help will be appreciated. Thank you!

re: Question on the sudoku solution on this website

The value row[i][val] represents the status that value val is present in row i. The same reasoning applies to the other boolean arrays.

If you look at the solve() method only empty squares are checked, so for a value val to be possible at an empty square i,j there shouldn't be a value val in the same row (row[i][val]) or same column (col[j][val]) or a value val in the same sub-square.

When the arrrays are created with the new operator all values are initialized to the value false implicitly which conforms to an initially empty sudoku board.

kind regards,

Jos