The discussion revolves around the problem of generating a tree in a cubic lattice that can visit every cell exactly once from any starting cell without marking cells as visited. The scope includes theoretical exploration and potential applications in combinatorial structures.
There is no clear consensus on the method to achieve the desired tree structure, and the discussion includes varying perspectives on the nature of the inquiry.
The discussion lacks specific details on the proposed solution and does not address the underlying assumptions or mathematical frameworks necessary for the problem.
Is this schoolwork?intervoxel said:I need to generate a tree in a cubic lattice that, from any cell, visits every other cell in the lattice just once. This visit must be blind, that is, it is not allowed to mark the cell as visited.
Thanks in advance for any solution or reference.