| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Updated videos | ||||||
| attached to Universal Manipulator Does Chess | ||||||
The algorithm for finding the longest path in a graph is NP-complete. For you systems people, that means it's *real slow*. -- Bart Miller
| Subject | Datestamp | Replies | Score | |||
|---|---|---|---|---|---|---|
| Updated videos | ||||||
| attached to Universal Manipulator Does Chess | ||||||
The algorithm for finding the longest path in a graph is NP-complete. For you systems people, that means it's *real slow*. -- Bart Miller