Solving the "n_1 × n_2 × … × n_k Dots Puzzle"
收藏官方服务：
资源简介：
The aim of this paper is to search to find the exact solution of the NP-complete n_1 × n_2 × … × n_k dots puzzle (an extension of the well-known nine dots puzzle of Samuel Loyd), when k≥3.
提供机构：
Zenodo创建时间：
2025-02-17
