Re: Maze searching problem

Article View: comp.theory

Article #1963

#1963

From: Douglas M. Pase
Date: Fri, 08 Apr 1988 20:31

9 lines
795 bytes

In article <ogcvax.1613> pase@ogcvax.UUCP (Douglas M. Pase) writes:
  The problem is determine whether the goal is reachable from the start
  within an O(log n) space bound and no time bound.
 --------------------------
 It seems a simple dynamic programming approach would solve this easily.

OOPS... dynamic programming would use O(n) space.
-- 
Doug Pase  --  ...ucbvax!tektronix!ogcvax!pase  or  pase@cse.ogc.edu (CSNet)

Technical Details

Message-ID: <1615@ogcvax.UUCP>

Path: arc1-ca.pugleaf.net!utzoo!mnetor!uunet!littlei!ogcvax!pase

References: <svax.2119> <ogcvax.1613>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!mnetor!uunet!littlei!ogcvax!pase
From: pase@ogcvax.UUCP (Douglas M. Pase)
Newsgroups: comp.theory
Subject: Re: Maze searching problem
Message-ID: <1615@ogcvax.UUCP>
Date: 8 Apr 88 20:31:34 GMT
References: <svax.2119> <ogcvax.1613>
Reply-To: pase@ogcvax.UUCP (Douglas M. Pase)
Organization: Oregon Graduate Center, Beaverton, OR
Lines: 9

Reply to Parent Message