Among the odder things to do on Maundy Thursday
is to write a Haskell program to enumerate polyominos. There are 369 such consisting of eight tiles.
To my slight disappointment, even when compiled with ghc, it is about 12% slower than the Python equivalent. And the Python draws the tiles out to a .PNG file, whilst I've no idea how to get the Haskell to do that.
This is the software equivalent of a CRIT request: could I ask Haskellian or Pythonesque readers to have a look at the code and point out where I'm committing staggering solecisms of style and speed?
OK, probably many of them will be at Eastercon as they read this, as will I be tomorrow.
To my slight disappointment, even when compiled with ghc, it is about 12% slower than the Python equivalent. And the Python draws the tiles out to a .PNG file, whilst I've no idea how to get the Haskell to do that.
This is the software equivalent of a CRIT request: could I ask Haskellian or Pythonesque readers to have a look at the code and point out where I'm committing staggering solecisms of style and speed?
OK, probably many of them will be at Eastercon as they read this, as will I be tomorrow.
no subject
no subject
is an attempt at improvement, mostly in style.