I just realized - you mentioned that you are using Python to run it - if
you use PyPy instead, you should get about 3x speedup or more.
That was a great suggestion! With PyPy michi now takes less than one minute
per move. Maybe I'll play it some more..
mr. Andrea Carta
You'll need to start reading/changing the code - the second point is
about the N_SIMS variable.
Well, I don't like changing other people's software, but if you wish...
What kind of computer are you playing on?
It might be that on Windows Python cannot use multiple processes...
Windows 7 on
Windows 7 on a I5 processor, and I'm quite sure multiprocesses is OK (I see
5 python processes running when michi is thinking). Maybe it's multicore
usage not working properly. I will investigate that.
I just realized - you mentioned that you are using Python to run it - if
you use PyPy
On Fri, Mar 27, 2015 at 02:18:05PM +, Andrea Carta wrote:
You'll need to start reading/changing the code - the second point is
about the N_SIMS variable.
Well, I don't like changing other people's software, but if you wish...
Well, reading and tweaking the source code is the whole
very nice job
2015-03-25 16:36 GMT+01:00 Petr Baudis pa...@ucw.cz:
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
On 25/03/2015 16:36, Petr Baudis wrote:
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
It should be enough to just enter the path to the program, make sure to
pass the gtp parameter. Try opening the shell window to investigate
if you hit trouble.
After opening the shell window it works: michi.py is the right command to
let it work (of course I have the Python interpreter
The correct parameter is 'gtp', not '--mode gtp'.
That worked! It was necessary to insert full path of python executable
followed by full path of michi, then gtp. Full path of michi only + gtp
throws again the same error (not a win32 application).
Other things:
- when playing (michi) against
On Thu, Mar 26, 2015 at 08:59:36PM +, Andrea Carta wrote:
Other things:
- when playing (michi) against GnuGo (that was winning) I inserted a wrong
move, then typed help hoping to get help about getting the move back. The
program crashed.
- at the moment I'm playing myself against michi.
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)?
-
20 matches
Mail list logo
