[Haskell-cafe] New Benchmark Under Review: Magic Squares

[Brent Fulgham]

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Daniel,

> I have now tuned Josh Goldfoot's code without changing the order in  
> which the
> magic squares are produced, for a 5x5 magic square, my machine took  
> about 1
> 1/2 hours and used 2Mb memory (considering that the original code  
> did not
> finish within 4 1/2 hours here, that should push time on the  
> benchmarking
> machine under 3000s and put us in the lead, I hope).

Thanks for your efforts on this project.  I'm actually more  
interested in using your earlier solution, since it is so much  
faster.  Right now, the magic square code rises in runtime from 1.5  
seconds to 4 hours with an increase of 1 in the square's dimension.   
I would much rather use a technique that had a more linear (or even  
exponential) increase!

I would propose modifying the other entries (since there are only a  
handful) to match the output of your original solution.

What do you think?

- -Brent
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.2.2 (Darwin)

iD8DBQFEqpVmzGDdrzfvUpURAkPpAJ9oKTwzmUyTAoA6yQdOo7APKnXCqACghJEV
id5EqEyVKrvSlJlLH9JZTN0=
=jNXB
-----END PGP SIGNATURE-----