Re^2: Challenge: Box Blackout

I'm not too familiar with algorithm nomenculature, but if starting with a full board and working backward is an inverse backtrack, what would a non-inverse backtrack entail?

Thanks,

loris

"It took Loris ten minutes to eat a satsuma . . . twenty minutes to get from one end of his branch to the other . . . and an hour to scratch his bottom. But Slow Loris didn't care. He had a secret . . ."

Comment on Re^2: Challenge: Box Blackout

Replies are listed 'Best First'.
Re^3: Challenge: Box Blackout by traveler (Parson) on Jan 24, 2006 at 15:58 UTC
Well, a backtracking algorithm means working toward a solution, and, when you reach a dead end, going back to the last time you made a "choice". In many computer science classes students learn to implement a backtracking algorithm by solving the "Eight Queens Problem". You can google for that or check a CS text. The reason this is "inverse" is because you are starting with the "solution". I think that would be faster and easier to write, personally, but I might be wrong.	[reply]

Replies are listed 'Best First'.

Re^3: Challenge: Box Blackout
by traveler (Parson) on Jan 24, 2006 at 15:58 UTC

The reason this is "inverse" is because you are starting with the "solution". I think that would be faster and easier to write, personally, but I might be wrong.

[reply]