A whole lotta weasels

A joint effort to write the Dawkins' Weasel algorithm in as many languages as possible, using the language's specific idioms.

Algorithm described here.

• Each implementation should only be one file and placed in the root folder.
• Each file should be named by the language in which it was written.
• The program should print the fittest string of each generation, as well as the number of generations it took.
• Mutation rate should be 4%, generation size 100.

Each implementation should, as far as it is feasable, capture the charachteristics of that language. The goal is readable and enjoyable implementations in as many languages as possible.

=======

Building the examples:

Below are the basic instructions to run the code examples, sorted by OS -> Language.

Ubuntu

Python

python python.py

Haskell

runhaskell haskell.hs

Go

apt-get install go
go run go.go

D

apt-get install gdc
gdc d.d
./a.out

F#

first install mono:

    apt-get install mono

clone the github repo and follow the instructions there (make && make install)

then:

    fsharpc fsharp.fs
    mono fsharp.exe

Common Lisp

install:

apt-get install sbcl

run:

sbcl --script common-lisp.lisp

Coffeescript

1. install node via apt-get

2. install coffee-script via npm

3. run:

    coffee coffee-script.coffee
   

Nimrod

1. Compile Nimrod from the github sources
2. run:

	nimrod -r nimrod.nim

perl

perl perl.pl