Re: [computer-go] UCT article
It's funny to English-speakers because when we think of marbles, we're thinking of something like this http://www.atoygarden.com/images/products/Marbles300.jpg Some games are played with marbles, but since in English the go pieces are called "stones" the concept of playing Go with marbles evokes images of white and black marbles rolling around the board. The reporter just got confused. On 2/21/07, Sylvain Gelly <[EMAIL PROTECTED]> wrote: my favorite line: > > "In Go all marbles are identical..." > My English prevent me to understand the subtlety here. Is there any relation to "the type of stone" meaning of marble? Sylvain ___ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/ ___ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
Re: [computer-go] Can a computer beat a human?
Turing Machines have an infinite tape -- I'm glad you set us straight on that. -Tom On 1/24/07, Don Dailey <[EMAIL PROTECTED]> wrote: On Wed, 2007-01-24 at 21:11 +0100, alain Baeckeroot wrote: > With 10^170 legal position for 19x19 what would be the size of this > table ? > I m afraid we cannot build it with all the matter in visible > universe. I think the computer science greats should have consulted you before writing their textbooks - I just looked at this crazy thing called a "turing machine" in one of my textbooks. A universal turing machine supposedly has an infinite tape attached to it. Maybe they are smart about computers, but they don't know anything about physics. I think all these textbooks need to be thrown out because they are obviously of no practical value. - Don ___ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/ ___ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
Re: [computer-go] Can a computer beat a human?
Nah, hash tables are amortized O(1). As long as you can address all that memory, 300MHz should be sufficient. On 1/24/07, Chris Fant <[EMAIL PROTECTED]> wrote: > Since no one has mentioned bounding memory, a complete lookup table (a > complete table of correct moves, perfect-hashed by board state) should do > the trick. > > cheers > stuart You're going to need more than 300MHz to do that lookup. ___ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/ ___ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
[computer-go] Best computer go development library?
Hi folks, I'm interested in doing some experiments in developing a computer go algorithm. I definitely don't want to rewrite any of the basic stuff (board management, scoring, etc) if it's already available somewhere. What's the best library available (if any) for doing this kind of thing? If it makes a difference, I'll probably be writing in C++ on Linux or C# on Windows, depending on the software available for each. Thanks Tom ___ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
