My Math Forum Find the minimum number of Moves

 Algebra Pre-Algebra and Basic Algebra Math Forum

 April 4th, 2009, 09:53 AM #1 Newbie   Joined: Apr 2009 Posts: 5 Thanks: 0 Find the minimum number of Moves We have a circle with center (0,0) and with radius 10. Now we have a limited set of moves possible e.g (2,1),(0,2) etc. Now using these moves we need to reach peripheral of Circle. But we need to make sure that we move very minimum. Just for an example We have a circle of radius 20 at center (0,0) Now we have these possible moves. (2,0) (0,2) and (2,1) Now let me know how many number of minimum moves you would require to reach at peripheral of center. Check the image.
 April 4th, 2009, 12:05 PM #2 Global Moderator   Joined: Dec 2006 Posts: 20,373 Thanks: 2010 In your diagram, the minimum number of moves is already illustrated (assuming no move may take you beyond the perimeter). Do you want a general procedure of some kind or just solutions for particular cases?
 April 5th, 2009, 02:06 PM #3 Member   Joined: Mar 2009 From: Asheville, NC Posts: 48 Thanks: 0 Re: Find the minimum number of Moves Well, as a quick general idea, total distances is what you're looking for. (2,0) and (0,2) both of a total distance traveled of 2, but (2,1) has a total distance traveled of $\sqrt{2^2+1^2}= \sqrt{5}$ So, use (2,1) until you are on the same value ( for instance, you were on the value x = 16 in the picture ) as the point you're looking for. This will maximize the total distance traveled.

 Tags find, minimum, moves, number

 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post chetjan Applied Math 0 August 28th, 2011 08:58 AM tvthinh Number Theory 4 July 19th, 2009 09:34 PM shalinisharma512 Number Theory 3 April 4th, 2009 12:56 PM K Sengupta Elementary Math 1 March 17th, 2009 10:06 PM K Sengupta Number Theory 10 February 19th, 2007 07:12 AM

 Contact - Home - Forums - Cryptocurrency Forum - Top