Computer Go progress has stopped?
http://www.sankei.com/life/news/150323/lif1503230014-n1.html
Cho Chikun plays computer with handicaps game.
http://www.nikkei.com/article/DGXMZO84490320X10C15A300/
Cho Chikun, a win, a lose against computer.
Hi!
So what's the strongest program you can make with minimum effort
and code size while keeping maximum clarity? Chess programers
were exploring this for long time, e.g. with Sunfish, and that inspired
me to try out something similar in Go over a few evening recently:
On Wed, Mar 25, 2015 at 4:57 PM, Petr Baudis pa...@ucw.cz wrote:
I'm afraid you won't get a good inspiration about properly implementing
a board structure. That would make the code a lot more complicated and
much longer!
And, uh, the program actually does not implement UCT. ;-) It uses RAVE
Awesome, Petr. I haven't programmed in Python for a long time (I like Ruby
better), but I think I should be able to understand it without a problem.
It seems like a good starting point to see how UCT is implemented (I still
haven't gotten around to it for my bot https://github.com/ujh/iomrascalai)
On Wed, Mar 25, 2015 at 04:49:04PM +0100, Urban Hafner wrote:
Awesome, Petr. I haven't programmed in Python for a long time (I like Ruby
better), but I think I should be able to understand it without a problem.
It seems like a good starting point to see how UCT is implemented (I still
haven't
So what's the strongest program you can make with minimum effort
and code size while keeping maximum clarity? Chess programers
were exploring this for long time, e.g. with Sunfish, and that inspired
me to try out something similar in Go over a few evening recently:
Based on my
observations, the limiting factor is time - Python is slw and
a faster language with the exact same algorithm should be able to speed
this up at least 5x, which should mean at least two ranks level-up.
Maybe a first step would be using numpy arrays for the board and
patterns.
On Wed, Mar 25, 2015 at 07:14:39PM +0100, Kahn Jonas wrote:
Based on my
observations, the limiting factor is time - Python is slw and
a faster language with the exact same algorithm should be able to speed
this up at least 5x, which should mean at least two ranks level-up.
Maybe a first
Cython works well too. Sage uses cython.
___
Computer-go mailing list
Computer-go@computer-go.org
http://computer-go.org/mailman/listinfo/computer-go
Oh wow, 640 lines? And gets 6k? Thats impressive! ___
Computer-go mailing list
Computer-go@computer-go.org
http://computer-go.org/mailman/listinfo/computer-go
On Thu, Mar 26, 2015 at 12:11:52AM +, Andrea Carta wrote:
Petr Baudis pasky at ucw.cz writes:
that inspired me to try out something similar in Go over a few evening
recently:
https://github.com/pasky/michi
Very nice work, dr. Baudis!
But:
- have you any idea how to get it to
Petr Baudis pasky at ucw.cz writes:
that inspired me to try out something similar in Go over a few evening
recently:
https://github.com/pasky/michi
Very nice work, dr. Baudis!
But:
- have you any idea how to get it to work with GoGui under Windows (I guess
it was developed under Linux)?
-
12 matches
Mail list logo