24 Nov
2009
24 Nov
'09
3:50 p.m.
Edward Z. Yang wrote:
If by greedy you mean depth-first and by broad you mean breadth-first, this is a certainly a good idea. If you'd like to look it up further, check "beam search".
I think I mean that. Thanks for the tip.
It sounds like you've basically got the algorithm written down, you have to translate it to Haskell. Do you have a specific problem?
No, I think I've got it now, but it is always interesting to me to see what new things I learn when the more experienced members on the list give me their thoughts. I'm just checking if anyone wants to suggest that I'm off course and a better way exists. Thanks, Mike