source: liacs/nc/low-correlation/mcs.m@ 39

Last change on this file since 39 was 38, checked in by Rick van der Zwet, 15 years ago

Made it MatLab compatible

File size: 765 bytes
Line 
1% Monte-Carlo Search Algoritm on low-autocorrelation program
2% BSDLicence
3% Rick van der Zwet - 0433373 - <hvdzwet@liacs.nl>
4
5% Brute-force result of length 20
6% best_20 = [-1,1,1,-1,-1,-1,1,1,-1,1,-1,-1,-1,1,-1,1,1,1,1,1];
7% autocorrelation(best_20);
8
9function [fitness,value] = mcs(length, iterations)
10 best_fitness = 0;
11 for i = 1:iterations
12 % Generate a random column s={-1,1}^n
13 n = length;
14 s = rand(n,1);
15 s = round(s);
16 s = s - (s == 0);
17
18 % Find whether we are better than everything else
19 fitness = autocorrelation(s);
20 if (fitness > best_fitness)
21 best_value = s;
22 best_fitness = fitness;
23 end
24 end
25 fitness = best_fitness;
26 value = best_value;
27end
Note: See TracBrowser for help on using the repository browser.