Monthly Archives: January 2010

See you at FOSDEM!

This year, I will be attending FOSDEM 2010 in Brussels (Belgium).

I'm going to FOSDEM, the Free and Open Source Software Developers' European Meeting

See you there!

Knight’s Tour brute force algorithm example

(From Wikipedia) The Knight’s Tour is a mathematical problem involving a knight on a chessboard. The knight is placed on the empty board and, moving according to the rules of chess, must visit each square exactly once. A knight’s tour is called a closed tour if the knight ends on a square attacking the square from which it began (so that it may tour the board again immediately with the same path). Otherwise the tour is open.

Just developed my brute-force algorithm implementation, using GLib and based on a simple recursive function.

Download and try it here!

As an example of result, this is the open Knight’s Tour found by the algorithm in a 5×5 board, starting from position [0,0]:

And this one, the first Knight’s Tour found by the algorithm in a 8×8 board, starting from position [0,0]:

Both examples above show open Knight’s Tours.

Simple LaTeX template for Books

I prepared a simple LaTeX template for Books and/or eBooks (“book” document class), showing the usage of several common packages (“geometry”, “inputenc”, “setspace”, “fancyhdr”, “tocloft”}.

You can download the source LaTeX template here!

And get a PDF using GNU Texinfo..
$> texi2pdf book_template.tex

Resulting PDF can be seen here!


Get every new post delivered to your Inbox.

Join 109 other followers