Re: wait 10233000

["Daniel Ajoy" <dajoy@xxxxxxxxxxxxxxxxxxxxx>]

On 26 Apr 2006 at 18:22, Seymour Papert wrote:

> Bad strategy 1:  Trying each number in turn. This  would eventually (!) 
> find it but would take far too long to be usable.
> Bad strategy 2: Keep guessing until you find an :n that works while :n 
> + 1 does not. Also impractical

Hi,

Sometimes brute force is not such a bad idea. Specially
when you can't come out with any other.

I made a program to find the points of intersection of two
circles given their radious and the coordinates of their 
centers using brute force.

The thing is shown here:

http://mondragon.angeltowns.net/paradiso/InterseccionCirculos.html


> Good strategy: ---- I'll send it next week if anyone asks. Hopefully 
> someone will post it before then.

Bisection method?

Using that, I got the following output

ct show bisec [mytest] 10233000 90233000
21474836

mytest was:

to mytest :n
carefully [wait :n] [output "false]
output "true
end


In my computer 

wait 21474836

waits almost nothing but gives no error.

However,

wait 21474837
wait does not like 21474837 as input


Daniel

PS. A week after I created that page about the intersection
of two circles I created this other page using a method similar
to the bisection method:

http://mondragon.angeltowns.net/paradiso/InterseccionCirculos2.html
	




*****************************
OpenWorld Learning
http://www.openworldlearning.org