This research aims to establish a lower bound for the mathematical problem involving multiple points.
Constructed theoretical framework for the problem
Extended analysis from the nine dots puzzle schema
Defined lower bound for the solution
Established connections to previous puzzles and analytical methods
Abstract
In this paper, we construct a lower bound for the solution of the "n₁ × n₂ × … × nₖ points problem" (an extension of the well-known "nine dots puzzle" by Samuel Loyd).