18 Mar
2009
18 Mar
'09
4:51 p.m.
On 2009 Mar 18, at 16:34, Colin Paul Adams wrote:
The one routine that stood out was this one (about 35% CPU time, with 0% attributed to children):
-- | Value of one rank of the board rank_value :: (Int, Array Int Square) -> Int rank_value (rank_coord, rank') = sum (map (cell_value rank_coord) (assocs rank'))
The array has 12 elements.
How many times do you call it? Perhaps the real optimization you need is to memoize. -- brandon s. allbery [solaris,freebsd,perl,pugs,haskell] allbery@kf8nh.com system administrator [openafs,heimdal,too many hats] allbery@ece.cmu.edu electrical and computer engineering, carnegie mellon university KF8NH