[m-dev.] ICFP Contest

[Peter Moulder]

Possible variation:

   - Change search problem from 2D to 4D (x,y,v,d).

   - Use a continuous approximation.

May be able to "pull the string tight".  Still need to decide where to
thread the string in the first place (which side of barriers to go),
but should greatly reduce the branching factor if that problem can be
solved.

I haven't looked at spatial search problems before, does anyone here
know how to do continuous search problems / continuous ink blot ?

pjm.

--------------------------------------------------------------------------
mercury-developers mailing list
Post messages to:       mercury-developers at cs.mu.oz.au
Administrative Queries: owner-mercury-developers at cs.mu.oz.au
Subscriptions:          mercury-developers-request at cs.mu.oz.au
--------------------------------------------------------------------------