C++ codes:

Performance of solution for the n-queens problem:

Queens Tn for S0 Tn for S1 Sn in T10
15<1 sec.<1 sec.1,844,702
150<1 sec.<1 sec.1,458,572
1,500<1 sec.<1 sec.326,627
15,000<1 sec.<1 sec.39,280
150,000<1 sec.<1 sec.3,667
1,500,0001 sec.2 sec.128
15,000,0001 sec.13 sec.-

Random numbers

Definition of ubit (unpredictable bit)

Entropy and serial correlation test

Entropy estimation tool

Intropy compile-time library

True random number generator: pandom

Rearray binary tool

Web hosting

Free web hosting service

Web hosting service FAQ

Linux tutorials

How to join your linux server to the NTP pool project


Stardust I

Der Flügelflügel

Graph theory

Conditional coloring

Suggestions for programming languages

Do ... while structure improvement

Nested namespaces by classes

Standard shrinkable arrays

Applications for a better world

Waterleaks platform

Debian packages

Public repository