Article View: comp.theory
Article #1961Clarification of maze problem
From: Alexander Siegel
Date: Fri, 08 Apr 1988 15:10
Date: Fri, 08 Apr 1988 15:10
10 lines
808 bytes
808 bytes
It doesn't matter if N is the number of vertecies or edges. A little thought
will reveal this. You are given LOG work tape Turing machine style. The soln
has to respect the direction of the paths.
--
Alex Siegel
(607)255-1165 (Low Bandwidth Audio)
4161 Upson Hall, Cornell University, Ithaca NY 14853 (Hard Copy)
siegel@svax.cs.cornell.edu (ARPAnet)
siegel@CRNLCS (BITNET)
{uw-beaver,ihnp4,decvax,vax135}!cornell!siegel (UUCP)
Technical Details
Message-ID:
<2129@svax.cs.cornell.edu>Path:
arc1-ca.pugleaf.net!utzoo!mnetor!uunet!husc6!bloom-beacon!mit-eddie!uw-beaver!cornell!svax!siegelShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!mnetor!uunet!husc6!bloom-beacon!mit-eddie!uw-beaver!cornell!svax!siegel From: siegel@svax.cs.cornell.edu (Alexander Siegel) Newsgroups: comp.theory Subject: Clarification of maze problem Message-ID: <2129@svax.cs.cornell.edu> Date: 8 Apr 88 15:10:52 GMT Organization: Cornell Univ. CS Dept. Ithaca NY Lines: 10 Keywords: maze, searching, DLOG