the patent is functionally meaningless. Who is
>> there to sue?
>>
>> Moreover, there is no enforceable patent on the broad class of algorithms
>> that could reproduce these results. No?
>>
>> s.
>>
>> On Fri, Dec 7, 2018, 4:16 AM Jim O'Flaherty
Tysvm for the clarification, Tokumoto.
On Thu, Dec 6, 2018, 8:02 PM 甲斐徳本 What's insane about it?
> To me, what Jim O'Flaherty stated is common sense in the field of patents,
> and any patent attorney would attest to that. If I may add, Jim's last
> sentence shou
suring the ground all around this area is
sufficiently salted to stop anyone from attempting to exploit nearby patent
claims.
Respectfully,
Jim O'Flaherty
On Thu, Dec 6, 2018 at 5:44 PM Erik van der Werf
wrote:
> On Thu, Dec 6, 2018 at 11:28 PM Rémi Coulom wrote:
>
>> Also,
Wow! Tysvm for the explicit _online_ game record.
White was FineArt. And Ke Jie, even granted a two stone handicap, lost in a
reading contest in a life/death struggle between two groups leading to the
resignation by move 78. That's astounding!
Namaste,
Jim O'Flaherty
Founder/CEO
h2
> because it is as strong as he is. Thanks, Ingo, for the iink to the
> forum. I have the games and will share them.
>
> Michael
>
> On 1/21/18 6:22 AM, Jim O'Flaherty wrote:
>
> It's unclear to me who played black with the two handicap stones. Ke Jie
> or F
It's unclear to me who played black with the two handicap stones. Ke Jie
or FineArt?
On Jan 21, 2018 1:56 AM, Ingo Althöfer <3-hirn-ver...@gmx.de> wrote:
> Stefan Kaitschick posted this in the German computer go forun:
> http://www.dgob.de/yabbse/index.php?topic=6728.msg215694#msg215694
>
> His
Dave,
To whom is the "your" in your first sentence referring? There is no context
from which to derive to whom you are speaking.
On Thu, Dec 7, 2017 at 3:30 PM, Dave Dyer wrote:
>
> Without reference to your specific ideas for games that might be
> difficult to solve, I wonder where these game
ess. If you are
interested, I would be happy to post the rules for the game.
Namaste,
Jim O'Flaherty
Founder/CEO
Precision Location Intelligence, Inc.
<http://www.precisionlocationintelligence.com/> • Irving, TX, USA
469-358-0633 <4693580633> • jim.oflaherty...@gmail.com •
ww
It's related to this line of thinking by Douglas Hoffstadter:
https://en.wikipedia.org/wiki/Copycat_(software)
Namaste,
Jim O'Flaherty
Founder/CEO
Precision Location Intelligence, Inc.
<http://www.precisionlocationintelligence.com/> • Irving, TX, USA
469-358-0633 <46935806
When I get time to spend dozens of hours on computer go again, I plan to
play in Robert's area with semantic genetic algorithms. I am an Architect
Software Engineer. Robert's work will allow me better than starting
entirely from random in much the same way AlphaGo bootstrapped from the
100K of prof
ars to fit just fine on this list. If the
person holding the theory spams the crap out of this list, then we can
address that as a separate concern just like we did with another email list
member just under two years ago.
Again, I appreciate your respectful tone.
Thank you,
Jim O'Flaherty
in from posting
non-Go related diatribes ESPECIALLY about other participating members.
Respectfully,
Jim O'Flaherty
On Tue, Oct 24, 2017 at 5:42 AM, wrote:
> On 2017-10-23 at 23:56, Thomas Rohde wrote:
>
> > On 2017-10-23 at 19:15, Xavier Combelle
> wrote:
> >
> &g
mple
compressed dump of it somewhere. Then, it would be just a matter of getting
it loaded into a DB to create all sorts of indexes, queries, novel subsets,
etc.
Namaste,
Jim O'Flaherty
Founder/CEO
Precision Location Intelligence, Inc.
<http://www.precisionlocationintelligence.com/> • Ir
That's exactly to what I was referring; the 29 million games. The amount of
data science delta analysis that could be done with that would be fantastic.
On Oct 23, 2017 11:42 AM, "Robert Jasiek" wrote:
> On 23.10.2017 14:05, Jim O'Flaherty wrote:
>
>> Couldn'
Couldn't they be useful as part of a set of training data for newly trained
engines and networks?
On Oct 23, 2017 2:34 AM, "Petri Pitkanen"
wrote:
> They are free to use in any attribution. Game score is a reflection of
> historical fact and hence not copyrightable. Dunno what use them are to
>
I have now heard that AlphaGo one by 0.5 points.
On Tue, May 23, 2017 at 2:00 AM, Jim O'Flaherty
wrote:
> The announcer didn't have her mic on, so I couldn't hear the final score
> announced...
>
> So, what was the final score after the counting of
The announcer didn't have her mic on, so I couldn't hear the final score
announced...
So, what was the final score after the counting of AlphaGo-vs-Ke Jie Game
#1?
___
Computer-go mailing list
Computer-go@computer-go.org
http://computer-go.org/mailman/li
uter-go.org] *On Behalf
Of *Jim O'Flaherty
*Sent:* Monday, April 17, 2017 7:05 AM
*To:* computer-go@computer-go.org
*Subject:* Re: [Computer-go] Patterns and bad shape
It seems chasing down good moves for bad shapes would be an explosion of
"exception cases", like combinatorially
It seems chasing down good moves for bad shapes would be an explosion of
"exception cases", like combinatorially huge. So, while you would be saving
some branching in the search space, you would be ballooning up the number
of patterns for which to scan by orders of magnitude.
Wouldn't it be prefer
Looks like AlphaGo is returning in May (next month):
http://www.wired.co.uk/article/deepmind-go-alphago-china-may-2017
___
Computer-go mailing list
Computer-go@computer-go.org
http://computer-go.org/mailman/listinfo/computer-go
NEAT and hyperNEAT are awesome when "evolving" fairly simple networks with
a very limited number of input and output dimensions. However, without
access to some serious computational power, scaling the NEAT method up to
the kind of level you would need for the current encoding methods for the
input
I like your perspective, Adrian. It is more inline with the fractal nature
of knowledge itself. And the idea that computers might be able to
computationally explore deeper iterations in the fractal space than are
currently possible within human neural cognition is quite exciting.
On Fri, Feb 10,
David, that's a fantastic and succinct summarization. Tysvm!
On Jan 9, 2017 12:19 AM, "David Ongaro" wrote:
> On Jan 5, 2017, at 10:49 PM, Robert Jasiek wrote:
>
>
> On 06.01.2017 03:36, David Ongaro wrote:
>
> Two amateur players where analyzing a Game and a professional player
> happened to
ek" wrote:
> On 06.01.2017 23:37, Jim O'Flaherty wrote:
>
>> into a position with superko [...] how do you even get AlphaGo into a the
>> arcane
>> state in the first place,
>>
>
> I can't in practice.
>
> I have not provided a way to be
a game of Go.
On Fri, Jan 6, 2017 at 12:55 AM, Robert Jasiek wrote:
> On 05.01.2017 17:32, Jim O'Flaherty wrote:
>
>> I don't follow.
>>
>
> 1) "For each arcane position reached, there would now be ample data for
> AlphaGo to train on that particular p
That was a quite elegant way to present the idea. Ty for sharing.
On Jan 5, 2017 8:36 PM, "David Ongaro" wrote:
> This discussion reminds me of an incident which happened at the EGC in
> Tuchola 2004 (maybe someone can find a source for this). I don’t remember
> all details but it was about like
both avoid it and then to optimize it to exploit the state itself.
On Thu, Jan 5, 2017 at 9:51 AM, Robert Jasiek wrote:
> On 05.01.2017 16:14, Jim O'Flaherty wrote:
>
>> For each arcane position reached, there would now be ample data for
>> AlphaGo
>> to train on
For each arcane position reached, there would now be ample data for AlphaGo
to train on that particular pathway. And it would emerge two strategies.
The first would be to avoid the state in the first place. And the second
would be to optimize play in that particular state. So, the human advantage
w
Tysvm for posting that!
I had predicted it was AlphaGo from the beginning. If there is a competitor
emerging, I think we would have seen some sort of publicity around it, if
not just to provoke a response with the AlphaGo team.
On Wed, Jan 4, 2017 at 9:11 AM, Janzert wrote:
> On 1/2/2017 7:05
Using Windows 10 and Chrome, I voted successfully. I also posted a link to
it on Facebook.
On Wed, Nov 30, 2016 at 11:21 AM, Michael Alford wrote:
> I've tried Firefox and Safari on Mac, and Firefox and Chrome on Debian. I
> have used the link and accessed the page from the main page. In all
>
Are you implying this email list will stop functioning if this domain isn't
renewed?
On Tue, Sep 27, 2016 at 12:07 AM, Joshua Shriver wrote:
> My domain expires in 6 days, so heads up it's free to grab if anyone wants
> it.
>
> -Josh
> ___
> Computer-g
Awesome! Tysvm!
On Thu, Jul 7, 2016 at 8:03 AM, Igor Polyakov
wrote:
> Here it is:
>
> https://youtu.be/KoIv7oYZ8wc
>
> On 2016-07-06 12:03, Jim O'Flaherty wrote:
>
> Any chance someone has put this on Youtube for those of us who primarily
> consume videos on phones
Any chance someone has put this on Youtube for those of us who primarily
consume videos on phones or tablets (where a 2.0GB is very large to store
locally)? And if so, replying with a link here would be deeply appreciated.
On Wed, Jul 6, 2016 at 10:38 AM, "Ingo Althöfer" <3-hirn-ver...@gmx.de>
wr
I enthusiastically second that!
On Jun 16, 2016 1:15 PM, "David Fotland" wrote:
> Can the lecture be recorded or broadcast for those of us who can’t be
> there?
>
> Regards,
>
> David
>
> > -Original Message-
> > From: Computer-go [mailto:computer-go-boun...@computer-go.org] On
> > Behalf
BTW, by improvement, I don't mean higher Go playing skill...I mean
appearing close to the same level of Go playing skill _per_ _move_ with far
less computational cost. It's the total game outcomes that will fall.
On Sun, Jun 12, 2016 at 3:55 PM, Jim O'Flaherty
wrote:
> The pu
The purpose is to see if there is some sort of "simplification" available
to the emerged complex functions encoded in the weights. It is a typical
reductionist strategy, especially where there is an attempt to converge on
human conceptualization. Given the complexity of the nuances in Go, my
intuit
Have you considered using either of the two high level Go AIs (mentioned on
this email group this last week) as your end-of-game live-group estimator
(and could even use their scoring mechanism, too)?
On Sun, Jun 12, 2016 at 8:02 AM, Henry Hemming wrote:
> Unfortunately I had to make some chang
Until it comes officially from Demis Hassabis, it's a rumor to drive
traffic to the "leak" announcer.
On Jun 10, 2016 9:25 AM, "Falk Heuer" wrote:
> According to China Daily from 31.5, they are probably playing in October.
> http://europe.chinadaily.com.cn/business/2016-05/31/content_25554898.htm
This is SO exciting.
On Jun 4, 2016 10:01 PM, Ingo Althöfer <3-hirn-ver...@gmx.de> wrote:
> Hi,
>
> during the amateur World Championships in Wuxi
> the new president of the international Go Association,
> Yang Jun'an, announced that Chinese young star Ke Jie
> will play against AlphaGo.
>
> No fi
This is wonderful, both the engine and the UI. And the fact the engine is
available alone, is awesome! Tysvm!
On Sat, Jun 4, 2016 at 6:20 PM, Gian-Carlo Pascutto wrote:
> Hi all,
>
> I've done a major update of Leela, including integration of DCNN, and
> optional usage of OpenCL to speed things
Tysvm! The video on Stream is a very nice touch. And the first review rocks!
On Fri, May 27, 2016 at 1:36 PM, Andreas Persson wrote:
> Congrats on the Steam release of Crazystone Rémi! Hope it will sell well.
> For people that haven't seen it here is a link
> http://store.steampowered.com/app/47
Hmmm...if bots weaker than GnuGo are actively discouraged, perhaps there
could be a separate tournament level for that grouping of "aspiring
computer Go" entrants (if it isn't too much extra work). Having bots earn
the right to move into the higher level of (i.e. have met the entry
requirement of "
Petr,
Tysvm! I really appreciate that.
Jim
On Thu, Apr 21, 2016 at 4:41 AM, Josef Moudrik wrote:
> Thank you!
>
> Dne čt 21. 4. 2016 11:17 uživatel Petr Baudis napsal:
>
>> Hi!
>>
>> Since "the record's stuck", I have found this as another rant without
>> point, and djhbrown hasn't resp
The td;lr I got from his "treatise" was "be cautious investing in mimicking
AlphaGo's success, or you will be electrocuted by some Jacob fella"
djhbrown's been doing pretty well recently staying related and relevant to
the subject area. This is the first time in awhile he's wandered this far
off i
What programming language and OS environment have you chosen?
On Apr 10, 2016 2:19 AM, "Jean-Francois Romang" wrote:
> Hello to everyone ; I'm a newcomer in this list and computer go
> programming. I have a chess programming background, but I want to start
> something new. :-)
> I'm currently in
amount to get a small payoff just to begin to sound out where the
threshold of diminishing returns might be on the top down approach.
Jim
On Thu, Mar 31, 2016 at 12:21 PM, Petr Baudis wrote:
> On Thu, Mar 31, 2016 at 08:51:30AM -0500, Jim O'Flaherty wrote:
> > What I was addressin
utcome remains a low
probability.
That said, I wish whomever takes on this project the very best of luck
because I will very much enjoy being wrong about this...at someone else's
expense. :)
Jim
On Thu, Mar 31, 2016 at 6:04 AM, Petr Baudis wrote:
> On Wed, Mar 30, 2016 at 09:58:48AM -0500,
Ingo,
That's precisely what has my knickers in a twist regarding djhbrown; his
prior behavior. I'm with you in that I hope that he better manages his
participation and uses list feedback to spend a little more time filtering
what his "creativity" so it fits closer to the listening of this specific
Robert,
This is exactly why I think the "explanation of the suggested moves"
requires a much deeper baking into the participating ANN's (bottom up
approach). And given what I have read thus far, I am still seeing the risk
extraordinarily high and the payoff exceedingly low, outside an academic
con
I don't think djhbrown is a software engineer. And he seems to have the
most fits. :)
On Wed, Mar 30, 2016 at 6:37 PM, uurtamo . wrote:
> This is clearly the alphago final laugh; make an email list responder to
> send programmers into fits.
>
> s.
> On Mar 30, 2016 4:16 PM, "djhbrown ." wrote:
I agree, "cannot" is too strong. But, values close enough to "extremely
difficult as to be unlikely" is why I used it.
On Mar 30, 2016 11:12 AM, "Robert Jasiek" wrote:
> On 30.03.2016 16:58, Jim O'Flaherty wrote:
>
>> My own study says that we canno
My own study says that we cannot top down include "English explanations" of
how the ANNs (Artificial Neural Networks, of which DCNN is just one type)
arrive a conclusions. If you want to translate the computational value of
an ANN into something other than the essential operation that it is
perform
Which one is Remi's?
On Thu, Mar 24, 2016 at 1:09 AM, David Fotland
wrote:
> There was one program (Shrike) that had a dnn without search. It didn’t
> finish in the top 8. Zen and Crazystone have custom DNN implementations.
> Dark Forest uses Torch. The rest used Caffe.
>
> Remi's implementat
I think you are reinforcing Simon's original point; i.e. using a more fine
grained approach to statically approximate AlphaGo's ELO where fine grained
is degree of vetting per move and/or a series of moves. That is a
substantially larger sample size and each sample will have a pretty high
degree of
This is wonderful! Tysvm for reposting!
On Thu, Mar 17, 2016 at 3:07 PM, Álvaro Begué
wrote:
> A while back somebody posted a link to a browser implementation of a DCNN:
> https://chrisc36.github.io/deep-go/
>
> Would something like that do?
>
> Álvaro.
>
>
>
> On Wed, Mar 16, 2016 at 4:44 PM,
So I hear you volunteering to create and maintain that site/page? {smirk}
On Mar 19, 2016 6:40 AM, "Gonçalo Mendes Ferreira" wrote:
> Instead of just redirecting, it could be a directory page for:
> - various Nick Wedd pages
> - CGOS
> - mailing lists
> - the game AI forum
> - news sites
> - aggr
Whatever the case, a huge turn has been made and the next 5 years in Go are
going to be surprising and absolutely fascinating. For a game that +2,500
years old, I'm beyond euphoric to be alive to get to witness this.
On Mon, Mar 14, 2016 at 4:15 PM, Darren Cook wrote:
> > You can also look at t
ll level.
And your right about the more rigorous meaning of teacher (or Sensei) being
quite a bit further away. I'm hopeful other AI breakthroughs outside of the
Go domain will help close the gap more quickly.
On Mar 14, 2016 9:21 AM, "Robert Jasiek" wrote:
> On 14.03.2016 08:59,
"Who cares if the best chess program is 400 or 600 points stonger than best
human. They are strong enough."
This is a very limited view of this domain to think the only intention in
creating a Go AI is to play against humans and beat them. There is a much
larger and richer world of values we get t
I'd expect this achievement by AlphaGo is very similar to when the first
human ran a 4 minute mile. No one had done it prior. However, right after
Roger Bannister did it, suddenly there were people all over the planet
doing it. Roger Bannister essentially made the possibility real, and then
the psy
. This
>> way AlphaGo will be forced to demonstrate its full strength over
>> a whole game
>> which we are all too curious to see.
>>
>> Thomas
>>
>> On Sat, 12 Mar 2016, Aja Huang wrote:
>>
>>
has won the match against Lee Sedol. But there are
>> still 2 games to play.
>> Aja
>>
>> On Sat, Mar 12, 2016 at 5:49 PM, Jim O'Flaherty <
>> jim.oflaherty...@gmail.com> wrote:
>> It was exhilerating to witness history being made! Awesome!
>&
It was exhilerating to witness history being made! Awesome!
On Sat, Mar 12, 2016 at 2:17 AM, David Fotland
wrote:
> Tremendous games by AlphaGo. Congratulations!
>
>
>
> *From:* Computer-go [mailto:computer-go-boun...@computer-go.org] *On
> Behalf Of *Lukas van de Wiel
> *Sent:* Saturday, March
I think we are going to see a case of human professionals having drifted
into a local optima in at least three areas:
1) Early training around openings is so ingrained in their acquiring
their skill (optimal neural plasticity window), there has been very little
new discovery around the first thir
I just realized that game 2 happened last night. ARGH! Stupid timezone
error.
On Thu, Mar 10, 2016 at 9:19 AM, Jim O'Flaherty
wrote:
> I was surprised the Lee Sedol didn't take the game a bit further to probe
> AlphaGo and see how it responded to [...complex kos, complex ko f
I was surprised the Lee Sedol didn't take the game a bit further to probe
AlphaGo and see how it responded to [...complex kos, complex ko fights,
complex sekis, complex semeais, ..., multiple connection problems, complex
life and death problems] as ammunition for his next game. I think he was so
as
Congratulations, AlphaGo and team. And by resignation! That's fantastic!
Anyone know where the tipping point was? Did Sedol get the end game order
just slightly off and AlphaGo took advantage? Or was their an earlier poor
move by Sedol and/or surprising (and good) move by AlphaGo? I'm WAY too
weak
Aja,
My anticipation couldn't be any higher, I don't think! I wish you and your
AlphaGo team the best of luck!
Namaste,
Jim
On Mon, Feb 22, 2016 at 10:12 AM, Aja Huang wrote:
> Hi Ingo,
>
> On Mon, Feb 22, 2016 at 3:49 PM, "Ingo Althöfer" <3-hirn-ver...@gmx.de>
> wrote:
>>
>> By the way: is
Robert,
How have these things emerged in the chess AI world following Deep Blue and
Kasperov's loss over a decade ago? To what degree does "human expert
details of chess theory matters" (where the term "matters" is pretty
squishy). From what I can see, that is not what happened and while I am not
16 3:03 PM, "Rainer Rosenthal" wrote:
> ~~
> Robert: "Hey, AI, you should provide explanations!"
> AI: "Why?"
> ~~
>
> Cheers,
> Rainer
>
>> Date: Mon
Robert,
I'm not seeing the ROI in attempting to map human idiosyncratic linguistic
systems to/into a Go engine. Which language would be the one to use;
English, Chinese, Japanese, etc? As abstraction goes deeper, the nuance of
each human language diverges from the others (due to the way the human
Richard,
I'm probably missing the obvious, I went to the forum, but was unable to
find a forum specifically for Go. I found Abolone, Hex and several others.
Thank you,
Jim
On Fri, Jan 1, 2016 at 9:08 AM, Richard Lorentz
wrote:
> Thank you very much. Personally I find it much easier to keep
t to move there, I feel that splitting into two online discussion places
> would be detrimental. I won't censor topics about the game of Go on
> game-ai-forum.org, though, if you really want to post there.
>
> Rémi
>
> On 02/01/2016 02:56 PM, Jim O'Flaherty wrote:
>
&g
I think the first goal was and is to find a pathway that clearly works to
reach into the upper echelons of human strength, even if the first version
used a huge amount of resources. Once found, then the approach can be
explored for efficiencies from both directions, top down (take this away
and see
Ah. That makes sense. It's a pattern centered on a possible next move. Very
cool. Tysvm for explaining.
On Tue, Nov 3, 2015 at 1:33 PM, Detlef Schmicker wrote:
> -BEGIN PGP SIGNED MESSAGE-
> Hash: SHA1
>
>
>
> Am 03.11.2015 um 20:24 schrieb Jim O'Flaherty:
&g
I don't see how "leave the center empty" works as a valid case, assuming
this it just any valid 3x3 window on the board. Given bots playing each
other, there can be 9x9 clumps of a stone of the same color. I can see it
being argued there is no computational value in this specific pattern
instance.
I second Peter's response.
On Oct 10, 2015 10:33 AM, "Peter Drake" wrote:
> I'm also for no limits, if only because there's no way to enforce them.
>
> If there is to be a limited division, I'd like to see all programs run on
> identical hardware.
>
> On Fri, Oct 9, 2015 at 6:07 AM, Hiroshi Yamas
I think you enjoy seeing what you write and/or visually concoct. And I'm
not sure anyone but you understands what you write and visually concoct. I
have the vague notion your shooting blindly into this cognitive space
hoping to hit a eureka mother lode; kind of like playing the lottery. Each
email
You mean literally the slowest of all the constraints in all of software
engineering (excluding waiting on UI input) in a domain that cannot
currently get enough unconstrained CPU and memory cycles?
On Fri, Oct 2, 2015 at 8:53 AM, djhbrown . wrote:
> .
> "sharing code is typically not going to b
Gonçalo wrote, "Well, I'd argue there is nothing inherently superior about
copying the human natural processes..."
I couldn't agree more! What inspires me about biological evolution is it's
fantastic use of temporal accretion compression; i.e. DNA viewed as
fractals. Given that meta-"natural proce
Awesome! Tysvm for replying and posting the link.
On Thu, Sep 10, 2015 at 4:26 AM, Robert Jasiek wrote:
> On 10.09.2015 10:29, Jim O'Flaherty wrote:
>
>> Perhaps you could give some more concrete examples of what you have done
>> already; i.e. where you have mov
I'm very much looking forward to your sharing your progress with us.
Perhaps you could give some more concrete examples of what you have done
already; i.e. where you have moved from the messy human
linguistic/cognitive "principles" to something much more formal?
On Thu, Sep 10, 2015 at 2:23 AM, Ro
I'm not convinced that it's reducible (as in reductionism) to get to a
rational (i.e. highly influenced by deterministic math) set of principles
to describe Go (which appears to be a precondition to getting it mapped
into your expert system). In fact, I don't think it can currently be done
for a st
I disagree with the assertion MC must be the starting point. It appears to
have stagnated into a local optima; i.e. it's going to take something
different to dislodge MC, just like it took MC to dislodge the traditional
approaches preceding MC's introduction a decade ago. Ultimately, I think it
can
I think you forgot to suggest which pharmaceuticals, legal or otherwise, to
be using while watching this. Without said pharmacological assistance, that
video doesn't make a bit of sense to me.
On Wed, Sep 2, 2015 at 9:13 PM, djhbrown . wrote:
>
> https://www.youtube.com/watch?v=opOAFYutILU&index
ils in the
"thread". Select that email. Scroll to the bottom. And if it is not already
" expanded", select the final email in the thread, and you should see the
one you sent.
I sure wish there was more options in Gmail around this behavior.
Jim O'Flaherty
On Jan 1
Darren,
If it doesn't work on Wine, you could always load a VM, like Sun's VirtualBox,
install a copy of Windows in that and play from there. VirtualBox has very good
performance metrics at above 95% of max (non VM) speed. And there's plenty of
throw-away copies of XP licenses available all ove
Don and Dave,
Perhaps it might be useful to use something smaller than 5x5. For
example, is 2x2, 3x3 and 4x4 "solved" and "verfiable"? If so, how might
one go about providing evidence for the "solution" and then for the
"verifiability"? It seems that what might work for these ought to also
wo
saying it is an MC program; association
versus identity.
Jim
Rémi Coulom wrote:
Jim O'Flaherty wrote:
Remi,
I find it interesting that he won with the slowest hardware. I am
still wondering how much performance is still a low influencer. In
other words, a really fast poor algorit
Oops...should have read "...a really fast poor algorithm won't be*_at_*
a better algorithm on slower hardware..."
Jim O'Flaherty wrote:
Remi,
I find it interesting that he won with the slowest hardware. I am
still wondering how much performance is still a low influencer
Remi,
I find it interesting that he won with the slowest hardware. I am still
wondering how much performance is still a low influencer. In other
words, a really fast poor algorithm won't be a better algorithm on
slower hardware (or slower software).
Jim
Rémi Coulom wrote:
Ingo Althöfer w
All,
I was wondering if there was a newer version of Mogo available to try
out. The one I know about (version 3) is located here:
http://www.lri.fr/~gelly/MoGo.htm
It's not like I am consistently beating it as I am around a 7k. However,
I was wondering if there was a newer version that might
Mark,
I would figure that given the popularity of both Eclipse and git, the problems
connecting the two easily, similar to the way Eclipse and Subversion connect,
will be solved sooner rather than later. And once they are, it won't be too
difficult to transition from whatever you choose to use
Don,
Here's the Javadoc for Random() in 1.6:
http://java.sun.com/javase/6/docs/api/java/util/Random.html
In a quick search with Google, I was able to see that Java's Random()
implementation is considered moderate quality, meaning it is adequate
for most applications, but inadequate for securit
What were the software improvements? Were they related to the code distributing
the work, or to the actual game playing/move selection code?
Jim
- Original Message
From: Robert Waite <[EMAIL PROTECTED]>
To: computer-go@computer-go.org
Sent: Wednesday, August 27, 2008 9:54:14 AM
Subj
All,
Can anyone detail the design of the version of Mogo that beat the
professional? Or is there a web-page where at least the general approach
has been described? Is the information even public? I am not seeing the
the implementation details, just the overall design and general
strategies. H
All,
What's available in terms of a quality Go game player/client/recorder for
mobile phones? I have a Windows Mobile 6 phone (AT&T Tilt - 8925) and would
like to be able to play the occasional casual game, be able to connect and play
with someone else on their mobile phone or desktop PC and to
All,
Another option is to use a VM, MS's Virtual PC (free), VMWare's offering (free
for non-commercial use) or any of the flavors of the open source Xen.
Basically, you can set up an install of whatever target environment you use as
a client OS. And then install and configure all you need and w
I'll second both the original poster (his troubles with Linux mirrored mine)
and the reply (I was completely enthralled with Ubuntu...WOW!).
Jim
- Original Message
From: Álvaro Begué <[EMAIL PROTECTED]>
To: computer-go
Sent: Wednesday, April 9, 2008 10:18:11 AM
Subject: Re: [computer-g
Darren,
Thank you for posting the links. Very nice. It could be my lack of
understanding the intention of each of the tests, but it looks like most of
them are micro-benchmarks, meaning there is single or very few methods calls
and a very well defined micro-space. I can understand how doing so
1 - 100 of 126 matches
Mail list logo
