On 2/17/07, Luke Gustafson [EMAIL PROTECTED] wrote:
Lukasz, any chance you can access the assembly to see how the compiler
optimized it differently? That is a strange result. All that I could think
of is, if you have several places where the function is called, and the
compiler used to be
Lukasz, any chance you can access the assembly to see how the compiler
optimized it differently? That is a strange result. All that I could think
of is, if you have several places where the function is called, and the
compiler used to be inlining it, it may be faster (for cache reasons) to
The library is just a bunch of code and You can do whatever You want with it.
I'm realistic, what matters is: what You have learned, does Your program works.
So just get the code and hack it as fast as You can to get some effect
asap, to feed Your motivation, to get more effect fast, etc...
On Thu, Feb 15, 2007 at 11:23:57AM +0100, ?ukasz Lew wrote:
I'm realistic, what matters is: what You have learned, does Your
program works. So just get the code and hack it as fast as You can to
get some effect asap, to feed Your motivation, to get more effect
fast, etc...
Ok, I do that.
Heikki Levanto wrote:
To get down to earth, I would like to look at the board at the end of
each playout, calculate something more than just win/loss, and pass that
info back to who ever called playout. One way to do that would be to
pass a function pointer and a (void?) pointer to playout, and
C++ function objects have overhead?
This is news to me... Any decent compiler can optimize these as well as a
direct function call. Also because of the way that the code is generated
using templates (as in machine language isn't generated until the actual
call is reached), function bodies are
2007/2/16, Nick Apperson [EMAIL PROTECTED]:
trouble. Also, the alternative is usually function pointers which have
atleast 50 times the overhead of a function object. Correct me if I'm
wrong.
- Nick
function objects really cannot be 50 times more efficient as function
pointer are rather
Functors if known at compile time will usually be inlines, but if they are
too big to be inlined then a regular (not indirect) function call will be
made so like call foo instead of like call [EDX] but when you use a
function pointer instead of a template function, this is what happens:
if all
?ukasz Lew wrote:
Generally http://en.wikipedia.org/wiki/Disjoint-set_data_structure
In my program it's a tree for each group of stones. In the root is
number of pseudoliberties.
Joining is cheap and checking group membership is cheap.
Look at chain_t class. in board.cpp
Best,
?ukasz Lew
I
On Wed, Feb 14, 2007 at 10:57:38PM +0100, ?ukasz Lew wrote:
Basically I wanted to implement a board in a hope that more people get
attracted to Computer Go. But now this is more or less accomplished.
So I decided to implement some kind of set canonical algorithms.
But only those most common, I
Does anyone know what find-union algorithms Lukasz is referring to
in the README file?
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
On 2/13/07, Heikki Levanto [EMAIL PROTECTED] wrote:
On Sun, Feb 04, 2007 at 02:13:33PM +0100, ?ukasz Lew wrote:
Optimizing and refactoring became my hobby, but it's too absorbing :)
It's time to add some features now.
Just one question: Is the gtp support sufficient to play against other
On 2/7/07, steve uurtamo [EMAIL PROTECTED] wrote:
And of course don't forget about this no_variable_in_for thing...
i'll have to read up on what you're describing.
The following pseudocode block
for (int i = 0; i 10; ++i) {
... code ...
}
// i's lifetime ends after the for loop does
is
: Monday, February 5, 2007 2:41:23 AM
Subject: Re: [computer-go] Effective Go Library v0.101
Effective Go Library:
http://www.mimuw.edu.pl/~lew/
Don't pick lemons.
See all the new 2007 cars at Yahoo! Autos
.
- Original Message
From: Łukasz Lew [EMAIL PROTECTED]
To: computer-go computer-go@computer-go.org
Sent: Monday, February 5, 2007 2:41:23 AM
Subject: Re: [computer-go] Effective Go Library v0.101
Effective Go Library:
http://www.mimuw.edu.pl/~lew
Hi,
EGB 0.101 is the last performance release:
50 kpps on 1.4 GHz and
80 kpps on 2.2 GHz.
Optimizing and refactoring became my hobby, but it's too absorbing :)
It's time to add some features now.
I consider 3 things:
- liberties tracing
- UCT tree search
- pattern tracing
Which feature You
UCT.
Cheers,
David
On 4, Feb 2007, at 5:13 AM, Łukasz Lew wrote:
It's time to add some features now.
I consider 3 things:
- liberties tracing
- UCT tree search
- pattern tracing
Which feature You would like to see implemented?
___
Effective Go Library:
http://www.mimuw.edu.pl/~lew/
On 2/4/07, David Doshay [EMAIL PROTECTED] wrote:
UCT.
Cheers,
David
On 4, Feb 2007, at 5:13 AM, Łukasz Lew wrote:
It's time to add some features now.
I consider 3 things:
- liberties tracing
- UCT tree search
- pattern tracing
18 matches
Mail list logo
