Qiming01 / LatinSquareCompletionView on GitHub
拉丁方补全问题是指在一个部分填有数字的n×n方格中,将剩余空白格子填入数字1到n,使得最终每一行和每一列都包含这n个数字且不重复。
26Dec 23, 2025Updated 2 months ago

Alternatives and similar repositories for LatinSquareCompletion

Users that are interested in LatinSquareCompletion are comparing it to the libraries listed below

Sorting:

Are these results useful?