PHP Programming Contest

[Nick Halstead]

Want to test your PHP programming skills? I have just launched a PHP
programming contest on my blog.

The problem

Many years ago there used to be a UK television quiz show (I am sure
there has probably been many versions in other countries) that
required the contestants to transform one word into another one letter
at a time. The only rule was that each letter change must also result
in a real word. Here is an example.

* Hand
* Band Changed 'H' to 'B'
* Bond Changed 'A' to 'O'
* Fond Changed 'B' to 'F'
* Food Changed 'N' to 'O'
* Foot Changed 'D' to 'T'

The challenge is to create a website that the user may supply an
arbitrary list of words which makes up a limited dictionary plus a
start and an end word. The website must then attempt to create the
shortest path between the two words following the rule that each
single letter change results in a word within the dictionary.

If you wish to take part go here -
http://blog.assembleron.com/2007/06/...n-zend-studio/

There is a copy of Zend Studio Professional up for grabs for the
winner!

[gosha bine]

On 14.06.2007 22:47 Nick Halstead wrote:

Want to test your PHP programming skills? I have just launched a PHP
programming contest on my blog.

The problem

Many years ago there used to be a UK television quiz show (I am sure
there has probably been many versions in other countries) that
required the contestants to transform one word into another one letter
at a time. The only rule was that each letter change must also result
in a real word. Here is an example.

* Hand
* Band Changed 'H' to 'B'
* Bond Changed 'A' to 'O'
* Fond Changed 'B' to 'F'
* Food Changed 'N' to 'O'
* Foot Changed 'D' to 'T'

http://en.wikipedia.org/wiki/Transitive_closure

hope this helps ;)
--
gosha bine

extended php parser ~ http://code.google.com/p/pihipi
blok ~ http://www.tagarga.com/blok

[=?ISO-8859-15?Q?Iv=E1n_S=E1nchez_Ortega?=]

gosha bine wrote:

http://en.wikipedia.org/wiki/Transitive_closure

I feel it's simpler to use a classic backtracking algorithm...

--
----------------------------------
Iván Sánchez Ortega -ivansanchez-algarroba-escomposlinux-punto-org-

Quien tiene problemas con telefonica tambien los tiene con su madre.

[C.]

On 15 Jun, 14:48, Iván Sánchez Ortega <ivansanchez-...@rroba-
escomposlinux.-.punto.-.orgwrote:

gosha bine wrote:

http://en.wikipedia.org/wiki/Transitive_closure

I feel it's simpler to use a classic backtracking algorithm...

....doesn't scale well. Hence genetic algortihms and annealing.

C.

[Schraalhans Keukenmeester]

At Fri, 15 Jun 2007 11:16:22 +0200, gosha bine let h(is|er) monkeys type:

On 14.06.2007 22:47 Nick Halstead wrote:

>Want to test your PHP programming skills? I have just launched a PHP
programming contest on my blog.

The problem

Many years ago there used to be a UK television quiz show (I am sure
there has probably been many versions in other countries) that
required the contestants to transform one word into another one letter
at a time. The only rule was that each letter change must also result
in a real word. Here is an example.

* Hand
* Band Changed 'H' to 'B'
* Bond Changed 'A' to 'O'
* Fond Changed 'B' to 'F'
* Food Changed 'N' to 'O'
* Foot Changed 'D' to 'T'

http://en.wikipedia.org/wiki/Transitive_closure

hope this helps ;)

LOL, Roy-Floyd to the rescue! To OP: while I applaud your contest
initiative, I think this puppy's been kicked around a tad too often to be
really challenging. Haven't you got a few other ideas? Perhaps something
that has some typical PHP challenges in it?

--
Schraalhans Keukenmeester - sc*********@the .Spamtrapexampl e.nl
[Remove the lowercase part of Spamtrap to send me a message]

"strcmp('apples ','oranges') < 0"