Re: hard puzzle
From: Matt Timmermans (mt0000_at_sympatico.nospam-remove.ca)
Date: 02/26/05
- Next message: JXStern: "Re: Cerberus and Quine"
- Previous message: Russell Easterly: "Number of 2SATs in 3SAT"
- In reply to: nobody: "Re: hard puzzle"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Fri, 25 Feb 2005 21:36:44 -0500
"nobody" <nobody@here.com> wrote in message
news:p97u119kc13cth55qlrtj0rsf3ekf309kl@4ax.com...
> "puzzlecracker" <ironsel2000@gmail.com> wrote:
>
>>#1. Given an n X m grid of characters. You are supposed to search for
>>a string with in this maze. The characters in the string need not be
>>alligned in a straight line. They just need to be holding adjusent
>>positiong.
>
> That's not hard at all, your typical search with backtracking.
I would have given them a polynomial time answer.
-- Matt
- Next message: JXStern: "Re: Cerberus and Quine"
- Previous message: Russell Easterly: "Number of 2SATs in 3SAT"
- In reply to: nobody: "Re: hard puzzle"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|