Christopher Smith wrote:
Carl Lowenstein wrote:
A couple of years ago some computer people applied known computer
search algorithms to the problem of reconstructiong a master key using
some working keys and a key-cutting machine. The idea was to
reconstruct the master one tumbler at a time.
I can't remember enough details to find it with Google. but perhaps
somebody else will have some neurons tickled by this.
That kind of smells like dyanmic programming.
http://en.wikipedia.org/wiki/Dynamic_programming
--Chris
Thanks Chris. This looks very similar to my problem. I'll check it out.
--
[email protected]
http://www.kernel-panic.org/cgi-bin/mailman/listinfo/kplug-lpsg
