Description
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.
Citations (0)
No citations found
It looks like this dataset has no citations.
Mentions (0)
No mentions found
It looks like this dataset has not been mentioned in any sources.
Metrics Over Time
Publication Details
Subfield
Discrete Mathematics and Combinatorics
Field
Mathematics
Domain
Physical Sciences
Confidence Score
43%
Source
Scholar Data Model
Keywords
nine dots puzzleCombinatoricsGraph theoryComputational science