Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: bitboards in java?

Author: José de Jesús García Ruvalcaba

Date: 09:17:38 04/08/99

Go up one level in this thread


On April 08, 1999 at 00:50:38, Dave Gomboc wrote:

>On April 06, 1999 at 23:24:09, Peter McKenzie wrote:
>
>>On April 06, 1999 at 15:35:54, Larry Griffiths wrote:
>>
>>>On April 06, 1999 at 14:58:42, vitor wrote:
>>>
>>>>i think i get the idea of bitboards but i dont know any C or C++ yet, i only
>>>>know java. so is it possible to implement bitboards in java and if so, how would
>>>>i do move generation with it?
>>>
>>>Vitor,
>>>
>>>I believe you can do bitboards in java.  JBuilder has a class for
>>>Big Integers with XOR, AND, and OR methods.  I have not used them
>>>so I do not know if these methods would be efficient.
>>>
>>>Larry.
>>
>>A long in java is a 64 bit signed integer, an unsigned long is a 64 bit unsigned
>>integer.  You can play with these using the normal C style bitwise operators.
>>
>>Peter
>
>Are there some Java compilers to native code that I don't know about?  My
>understanding is that the performance of JIT compilers on cpu-intensive code is
>approximately 40x slower than C++.  (Does that figure sound realistic?)
>
>Dave Gomboc

What is a JIT compiler?
I know there are java compilers for Solaris.
It is imposible for us to know if there are Java compilers to native code you do
not know about, as we are not aware of which ones you know about (:



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.