1 problem
The strong grid is the graph obtained from the square grid by joining vertices that are at king-move distance one, so each vertex is adjacent also to its diagonal neighbours. In th…
The strong grid is the graph obtained from the square grid by joining vertices that are at king-move distance one, so each vertex is adjacent also to its diagonal neighbours. In th…