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.
=======
Below are the basic instructions to run the code examples, sorted by OS -> Language.
python python.py
runhaskell haskell.hs
apt-get install go
go run go.go
apt-get install gdc
gdc d.d
./a.out
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
install:
apt-get install sbcl
run:
sbcl --script common-lisp.lisp
-
install node via apt-get
-
install coffee-script via npm
-
run:
coffee coffee-script.coffee
1. Compile Nimrod from the github sources
2. run:
nimrod -r nimrod.nim
perl perl.pl