Date: Thu, 9 Dec 1999 22:49:18 -0500 From: Cliff Crawford <cjc26@cornell.edu> To: Roelof Osinga <roelof@nisser.com> Cc: Brett Glass <brett@lariat.org>, freebsd-chat <chat@FreeBSD.ORG> Subject: Re: Yahoo hacked last night Message-ID: <19991209224918.A27912@cornell.edu> In-Reply-To: <38507672.25B7FB4F@nisser.com> References: <38502053.28737F7B@nisser.com> <4.2.0.58.19991209162117.00cc0670@localhost> <4.2.0.58.19991209200536.03b8b400@localhost> <38507672.25B7FB4F@nisser.com>
next in thread | previous in thread | raw e-mail | index | archive | help
* Roelof Osinga <roelof@nisser.com> menulis: > Brett Glass wrote: > > > > If it's allowed to run to completion it will do a complete depth-first > > search and generate all possible solutions -- provided, of course, that > > the tree is finite. > > And not all trees are. And there are those that recurse before the > path with the solution(s) is taken. Breadth first would solve that. Hmm..wouldn't iterative deepening be even better? It would be less memory-intensive than breadth-first. -- cliff crawford http://www.people.cornell.edu/pages/cjc26/ -><- "I am not an HTML tag!" --Manuel To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-chat" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?19991209224918.A27912>