On Sun, 8 Sep 2002, Eugene van der Pijll wrote: > In fact, this month's hole was so difficult that after a days work I > still had no working solution. Unfortunately, my attempts failed at the > longest test, and I nearly gave up on this hole. Only my embarrasment on > being in the sandtrap forced me to stay in the race.
i also thought this was a difficult task but not too difficult. if i hadn't been in a team i would've been stuck at over 200 strokes, probably, but infix/rpn is a classical computer science/mathematic thing, and it's interesting to find a short solution. you may find lots of references in books or on the net that have an algorithm for that, but doing it in perlgolf encourages you to find other algorithms. and for those who are perlgolf-newbies or not familiar with infix/rpn there's still the possibility to start with a classical algorithm found in a book. i think the easier a hole is, the more the solutions depend on those little tricks like reading the input and printing the output in a short way. these are interesting, no doubt, but they will reocur with every hole. the thing which is interesting for me with every new hole is the algorithm. (i have yet to understand eugene's one =) tina -- http://www.tinita.de/ \ enter__| |__the___ _ _ ___ http://Movies.tinita.de/ \ / _` / _ \/ _ \ '_(_-< of http://PerlQuotes.tinita.de/ \ \ _,_\ __/\ __/_| /__/ perception
