<?xml version="1.0" encoding="windows-1252"?>
<node id="77553" title="Re(tilly) 3: (Golf) Fragment Reassembly" created="2001-05-03 02:14:42" updated="2005-07-19 14:08:39">
<type id="11">
note</type>
<author id="26179">
tilly</author>
<data>
<field name="doctext">
Oops, my misreading.&lt;P&gt;

As for the question, there actually are well-explored
areas where the best known algorithms (by various criteria)
are found by randomly guessing something with certain
characteristics and then testing whether it really was a
solution...</field>
<field name="root_node">
77183</field>
<field name="parent_node">
77551</field>
</data>
</node>
