perplexus.info :: Just Math : Optimizing triangulation moves

Optimizing triangulation moves (Posted on 2025-02-26)

Alice has three pins, labeled A, B and C, respectively, located at the origin of the coordinate plane. In a move, Alice may move a pin to an adjacent lattice point at distance 1 away. What is the least number of moves that Alice can make in order for triangle ABC to have area 2024?

No Solution Yet Submitted by Danish Ahmed Khan

No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)

re: Analytic and a program

Comment 3 of 3 |

(In reply to Analytic and a program by Larry)

First, the problem doesn't specify the area be at least 2024. I interpreted it as the area must be exactly 2024.

Second, the moving constraints mean the most efficient way to build a large triangle isn't necessarily to make it nearly equilateral. A right triangle will do fine. (0,0) (64,0) (0,64) gives an even larger triangle of Area 2048 with the same number of moves.

Posted by Jer on 2025-02-27 08:01:38

Please log in:

Login:
Password:
Remember me:

Sign up! \| Forgot password

Search:

Search body:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (4)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info