For the incomplete methods, we kept the representation of the queens by a table and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems than the representation by a matrix.
heuristics: descent.
Tests: 100 queens in less than 1 second and 67 iterations. 500 queens in 1 second and 257 iterations. 1000 queens in 11 seconds and 492 iterations.
heuristics: Simulated annealing.
Tests: 100 queens in less than 1 second and 47 iterations. 500 queens in 5 seconds and 243 iterations. 1000 queens in 13 seconds and 497 iterations.
heuristics: based on Simulated Annealing.
Tests: 100 queens in less than 1 second and 60 iterations. 500 queens in 1 second and 224 iterations. 1000 queens in 5 seconds and 459 iterations. 10 000 queens in 20 minutes 30 seconds and 4885 iterations.
The program SPLAY is a pascal to C translation of a program that
Kim Kokkonen wrote in Turbo Pascal to implement Splay Trees.
This program compresses and decompresses files, and does a pretty good
job of it.
Contents:
SPLAY.PAS Original TP source code
SPLAY.C Translation of code to C
SPLAY.EXE Compiled version of SPLAY.C (small model)
README.DOC You are looking at it
Read the comments at the beginning of SPLAY.C for more info.
The Torque Network Library is a networking API designed to allow developers to easily add world-class multiuser simulation capabilities to their products.
to show the waveform of audio file and play it on computer
Purpose: Familiar with WAV file format and UI design
It should have the following functions:
Provide a Graphic User Interface for user to browse the file system and select one WAV file
Show the waveform of input audio signal
Play the selected WAV file
Print the parameters of WAV file such as sampling rate, bit-depth, etc
