You are given a 9x9 grid of numbers such that:
a. each row,
b. column,
and
c. each of the nine 3x3 grids
has each number 1 through 9 exactly once.
Lets call it Sudoku puzzle's solution or SPS.
A grid with condition c. removed is called a Latin Square, LS.
1. (d2) how many 9x9 LS's are there?
2. (d4) And how many 9x9 SPS's ?
(In reply to
re(2): solution (part 1 only) by Charlie)
Thanks for the check on LS, Charlie. No wonder I could not prove the validity of my Pt. 1 counting method: it was invalid. So, back to figuring out how to acquire the two numbers (both the LS and SPS)
Edited on July 15, 2018, 12:06 am
solutions TBD
