Reply to post: Re: @Charles

That virtually impossible classic compsci P vs NP problem is virtually impossible, say boffins

Charles 9

Re: @Charles

So what's the general solution for the shortest complete circuit that hits each town except the start/finish exactly once? You say it can be solved; let's see it.

POST COMMENT House rules

Not a member of The Register? Create a new account here.

  • Enter your comment

  • Add an icon

Anonymous cowards cannot choose their icon