[ View Thread ] [ Post Response ] [ Return to Index ] [ Read Prev Msg ] [ Read Next Msg ]

BGonline.org Forums

GNU vs XG walking in a prime

Posted By: Timothy Chow
Date: Friday, 18 September 2009, at 12:31 a.m.

In Response To: GNU vs XG walking in a prime (Bob Koca)

I think I've mentioned this before, but it seems that it should not be too hard to write a dynamic program that walks a prime optimally or at least nearly optimally. It would make a nice Master's thesis in C.S., I think. (Anybody here have a student to assign this to? Maybe I'll mention this to Art Benjamin.) This way we would know with much greater certainty than we do now how close to optimal the bots are for this problem.

It's pretty clear that if the walk is long enough then the prime is sure to crack (with a 4-4 for example) and allow the checker through. Exactly how long the walk needs to be, though, is not so clear.

Messages In This Thread

 

Post Response
Your Name:
Your E-Mail Address:
Subject:
Message:

If necessary, enter your password below:

Password:
 

 

[ View Thread ] [ Post Response ] [ Return to Index ] [ Read Prev Msg ] [ Read Next Msg ]

BGonline.org Forums is maintained by Stick with WebBBS 5.12.