|
MATHEMATICA
|
Table[Length@FindIndependentVertexSet[RelationGraph[EuclideanDistance[##] == 5 &, Tuples[Range[n], 2]], Infinity, All], {n, 8}]
|
|
PROG
|
(Python)
from networkx import empty_graph, find_cliques, complement
G = empty_graph((i, j) for i in range(n) for j in range(n))
G.add_edges_from(((i, j), (i+k, j+l)) for i in range(n) for j in range(n) for (k, l) in ((5, 0), (-5, 0), (0, 5), (0, -5), (3, 4), (3, -4), (-3, 4), (-3, -4), (4, 3), (4, -3), (-4, 3), (-4, -3)) if 0<=i+k<n and 0<=j+l<n)
return sum(1 for c in find_cliques(complement(G))) # Chai Wah Wu, Jan 11 2024
|