In this section, you can
try some various examples, ranging from the Fibonnacci sequence to the famous problem of the "Eight Queens".
These examples can be a lot more interesting considering the fact that you can bring your own modifications. That means, if you want to try again the Queens' problem with nine queens, just type in and ELAN will answer within a few seconds !
Fibonnacci: Fibonnacci was an Italian mathematician who proposed a serie consisting of the binary numbers extended. In other words, built from 0, 1. It is an
infinite serie that is defined as: tn = tn-1 + tn-2 with t0 = 1 ; t1 = 1
So, this yields, 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, etc. ad infinitum.
Queens: : classical puzzle of placing eight queens on an 8 X 8 chessboard such that no two queens kill each other, that is so that no two of them are on the same row, column or diagonal. A queen can kill in all straight lines in which it is placed as well as all diagonals. If a Queen is placed in the center, it can kill on left straight line, right straight line, up, down, diagonal direction from top left to bottom right and diagonal top right to bottom left. It kills in all eight directions. There are 92 solutions to this problem.
Horse: : the goal of this game is to move a horse on a chessboard (3*4) such that the horse passes exactly one time by each position.
Polynoms: : will let you try various operations on polynoms.