 | | Re: Brickgame [connect 4] algorithm
|
|
(...) Cool! I rather imagined that such might be possible-- And actually I suppose it wouldn't be *all* that difficult to write an algorithm to prove so, seeing that a game lasts no longer than 49 moves, and at each step, there are a max of 8 moves. (...) (24 years ago, 31-Jan-01, to lugnet.off-topic.geek)
|
| |
| | Re: Brickgame [connect 4] algorithm
|
|
(...) I remember reading some years ago that this game has actually been solved; that is, there is a way for whoever goes first to win every time. *does google search* Yeah. Victor Allis of Vrije Universiteit in Amsterdam. (URL) (...) (24 years ago, 31-Jan-01, to lugnet.off-topic.geek)
|
| |
| | Re: Brickgame [connect 4] algorithm
|
|
(...) I think I'd quantify that to something along the lines of (tell me if this sounds wrong): A. If there exists a line of 5 or more available spaces wherein my opponent has not taken any of them: B - If I have 0 of these spaces (excluding the (...) (24 years ago, 31-Jan-01, to lugnet.off-topic.geek)
|
| |
| | Re: Geeks and Toys on Netslaves
|
|
(...) You have a math degree and think you're not a geek??? Wahahahaha! (FUT just lugnet.off-topic.geek) ++Lar (24 years ago, 31-Jan-01, to lugnet.general, lugnet.off-topic.geek)
|
| |
| | Re: Geeks and Toys on Netslaves
|
|
(...) I'm not! You don't want to know how long it took me to figure out how to post on Lugnet! And one of the more painful experiences of my life was having to take a programming course in Pascal to get my math degree. Of course, as the daughter of (...) (24 years ago, 31-Jan-01, to lugnet.general, lugnet.off-topic.geek)
|
