http://qs321.pair.com?node_id=503366

Skeeve has asked for the wisdom of the Perl Monks concerning the following question:

You know these puzzles!? There is a drawing and you have to find out how many triangles one can see.

But that's boring. More interesting is it to write a perl script that will solve it for you.

I once did so and will post my solution as a reply to this.

Let's see your scripts. Solve the puzzle given at the page linked above. Should it not be there anymore, here is an ASCII-"Drawing" of it.

(A) /\ / /\ \ / / \ \ / / \ \ / / \ \ / (C)/ \(D) \ (B)/_______/__________\_______\(E) | \__ / \ __/ | | (F)X__ __X(G) | | / \___ ___/ \ | | / ___><___ \ | | / __/ (H) \__ \ | | / __/ \__ \ | |/_/____________________\_\| (I) (J)

The letters given in my "Drawing" are those I used in my script to mark the nodes.


s$$([},&%#}/&/]+}%&{})*;#$&&s&&$^X.($'^"%]=\&(|?*{%
+.+=%;.#_}\&"^"-+%*).}%:##%}={~=~:.")&e&&s""`$''`"e