[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
The clip of Ricky Ricardo showing DFS ;-) and cognitive plausibility of DFS
- To: Rao Kambhampati <firstname.lastname@example.org>
- Subject: The clip of Ricky Ricardo showing DFS ;-) and cognitive plausibility of DFS
- From: Subbarao Kambhampati <email@example.com>
- Date: Thu, 19 Jan 2012 18:22:58 -0700
- Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=gamma; h=mime-version:sender:date:x-google-sender-auth:message-id:subject :from:to:content-type; bh=X7lnJ9ufycFdi418bn49WjSrZUhMdHdlMbP/FWc7gkY=; b=UArm6/0ord/7GEUDkzqV7UhGWFnmvnCaK3somK7gDx08my+v5q3Jwuo7wkbhLC8gxx eZIGUtFboMtUObR28hYkAMQi2Tr6S19heS9cudn7FAu/Q8v6LUBjeKWtBOGVgTX8WXNg J7If89USwgdpgGmX+KoALSYEkoqcPS3Jidz34=
- Sender: firstname.lastname@example.org
you may split it into sub-problems p1...pk; and start doing p1. You may decide p1 is too hard still and
split it into p11, p12...p1j and start working on p11 (see the depth first nature?).
The advantage of going this way is that you need only a *STACK* to keep track of your goals (remember that LIFO--last in first out
queue--is really a stack). So you put P first on the stack. On top of it put p1...pk in order. now you remove top of the stack (p1) and put all its
subproblems p11..p1j on the stack. When all of those get done, the next one to be picked will be p2.