Hi Dmitry,
If you don't mind, I put the mailing list in copy so that everybody can
read this.
Hello Antoine,
I was reading the Computer Go mailing list and saw your message titled
"Fast play on 9x9 board using bitmaps". I am currently trying to
implement a fast bitmap go board. Therefore I
But as a chess programmer, I disagree with your statement about orders
of magnitude. If your chess program is 30% faster than mine, all else
being equal, you have a measurably stronger chess program and you will
probably win even a fairly short match. In a highly competitive chess
tourname
If this randint routine is critical, you can save some calls to rand()
when you know that n is always below some value (see my previous post
about bitmap go).
For instance if n < 128 (probably true for 9x9 go), you could try:
while (true) {
r = rand();
if ((r & v) < n) return (r & v);
r >>=
256), you can remove the 2 last shift
as well.
Antoine
I'm pretty sure the time of this function is dominated by the call to
rand(), but it never occurred to do a table lookup for the mask,
interesting idea.
- Don
On Thu, 2006-12-07 at 22:36 +0100, Antoine de Maricourt wrote:
Yes I used such a representation, not in the context of MC, but for
experimental algorithms where I needed to know all paths that could lead
from the root to a given node. I used a representation that I found
later to be described under the name 'twin node' (in someone's thesis I
guess, but
It would be interesting to see how your implementation performs on a
Core2 architecture. So how many 9x9 games does it currently play per
second? What about 19x19 games?
I don't know how many games it plays. As I said, I'm not really
interested in MC GO now. I played a few days with this c
When was your first post? The pseudo-liberty principle has been
described perhaps 15 years ago on this list. Possibly before, but I
wasn't there...
Antoine.
Wow. Did some of my early posts on liberties/chains actually get used
by someone? Or did the idea of pseudo-liberties and union set
plenty of time to think about computer go...
Antoine
It certainly pre-dates me then! My post was within the last 2 years.
Our of curiosity, did it have the name pseudo-liberties back then too?
-Original Message-
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf Of Antoine de
Incidentally, ?ukasz, if it is _your_ code, then you may do whatever
you
like with it, regardless of how you have licensed that code to other
people.
The only issue that I can see would be whether or not you are
permitted to
use chages, etc., that have been contributed by other people.
Hi René,
David,
Confession: I have not tested 19x19. As you have noted, and others
before you over the years, a 19x19 board does not fit in one but three
128-bit registers and there would be a rather big penalty as a result,
perhaps (likely?) wiping out all of the benefits of bitmaps. Antoine
René, please don't apologize.
I will start to feel embarassed...
I am very happy that you came out with a working implementation of the
ideas I explained, as I never really did it (I only had made some
preliminary implementation in order to evaluate the interest).
Arguments people give on this
If you didn't start writing your client, and if you use C++, you might
consider using wxwidgets.
It uses GTK under X11, and native UI system under Mac or Windows.
My understand is that there is a Mac port that doesn't need X11.
I'm hoping to do a viewing client in GTK and I would just need
Hi,
did you read Anti Huima's paper? The idea looks similar, but
unfortunately it does not work. I provided a proof of the defect on this
list (end of 2002 if I remember well). It's not that easy to get a
working scheme. In fact there is only one combination with 8 chunks of
data. In 2002 I e
Please do.
I will put it on a web page. But I need some time. My job keeps me very
busy right now.
But I'm not sure I
will post the statistical analysis (it was almost ten hand writen pages,
and I'm not sure I still have them).
Have You performed an empirical test for collisions?
No, analysis
On 2/10/07, Łukasz Lew <[EMAIL PROTECTED]> wrote:
On 2/10/07, Antoine de Maricourt <[EMAIL PROTECTED]> wrote:
> If there is strong interest, I can post the scheme.
Please do.
Since Antoine claims there is only on solution I might as well post
mine ;-)
mirroring: [abcdefg
15 matches
Mail list logo