Three new ideas about my Hadamard 428 project...
Make a clique-searching algorithm that will search through my current matrices (generated through the hill-climbing algorithm) and see how many mutually orthogonal rows I have right now.
Implement a new swap function that will swap the values of four elements, each from a different column group. This will depend on the "column feasibility," namely the number of +'s in each column.
Somehow modify the code so that the first three columns are fixed. This may reduce the headache somewhat...or not. (By the way, I'm thinking of the pronunciation of the word "column" as similar to the pronunciation of "volumn"... One undergrad prof pronounced it that way, and I thought it was pretty funny, and now I'm adopting it...)
Implement a new swap function that will swap the values of four elements, each from a different column group. This will depend on the "column feasibility," namely the number of +'s in each column.
Somehow modify the code so that the first three columns are fixed. This may reduce the headache somewhat...or not. (By the way, I'm thinking of the pronunciation of the word "column" as similar to the pronunciation of "volumn"... One undergrad prof pronounced it that way, and I thought it was pretty funny, and now I'm adopting it...)
posted by martin at
7:42 PM
0 Comments:
Post a Comment
<< Home