[sclug] links from meeting

Graham lists at Information-Cascade.co.uk
Thu Mar 15 23:51:34 UTC 2007

Garbage Collection

gcj (compiled Java) uses boehm-gc, as does Mars 'D'

svn checkout svn://gcc.gnu.org/svn/gcc/trunk gcc


Mastermind is different from sudoku, because
its not just CPU cycles, its the number of questions,
so you need (an algorithm or search) to find
the most pivotal question, that reduces the seach space.

A quick list, suggests that there are 5 generic initial moves,
and each move has 15 possible markings, so you could build a table
of the first 2 moves. The wiki web site offers algorithms,
but there are always options, such as using a move or colour that
you KNOW wont be correct, but is more pivotal.

Knuth suggests an initial move of "aabb", but the numbers (6**4=1296)
might be low enough to allow an exhaustive comparison of alogithms,
and even defeat the algorithm, knowing that its being used.


World Population - gnuplot line - one laptop each ?



More information about the Sclug mailing list