PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
May 4, 20260 citationsOpen Access

"n₁ × n₂ ×. . . × nₖ Points Problem": An Optimal General Algorithm

View Full Paper
VBValerio Bencini

Key Points

  • The aim is to develop an effective algorithm to address the N1 x N2 x ... x Nk points problem.
  • Introduced a new algorithm specifically designed for k=2 case.
  • Provided theoretical lower upper bounds for higher cases.
  • Achieved complete solutions for the k=2 scenario.
  • Established lower upper bounds for subsequent cases.

Abstract

In this paper, we present a new algorithm for the "n₁ × n₂ ×. . . × nₖ points problem" (an extension of the well-known "nine dots puzzle" of Samuel Loyd), able to solve completely the problem for the case "k=2" and, at the same time, provide lower upper bounds for the subsequent cases.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Valerio Bencini (2017) studied this question.

synapsesocial.com/papers/69f837ab3ed186a739981d61https://doi.org/10.5281/zenodo.19979298
Ask AI
Helpful
Bookmark
Share
View Full Paper