[Computer-go] Go Bot for the Browser?

Hi everyone, for a Go beginner website I would like to have a bot that runs in client-side javascript, it doesn't have to be that strong. An option might be transpiling gnugo with emscripten, but I'm not very familiar with that technology and the first google entry (

Re: [Computer-go] Go Bot for the Browser?

This is really cool. Now it just needs to learn 9x9 via reinforcement learning ;-) Josef Moudrik schrieb am Fr., 18. März 2016 10:21: > Aha! Thanks for the clarification. > > Josef > > Dne pá 18. 3. 2016 9:59 uživatel Darren Cook napsal: > >> > If I

Re: [computer-go] Re: Dynamic komi in commercial programs

Hi, I would like to know what exact experiments with virtual komi have been made and why thay failed. To me, this idea seems very natural, as it encodes the confidence of the stronger player that the weaker one will eventually make more mistakes on his own. You don't need to catch up a

Re: [computer-go] Re: Dynamic komi in commercial programs

You just hit the nail on the head.   Dynamic komi does not encourage a program to overplay the position.   Since you are starting from a losing position you HAVE to overplay a bit.   You have to attack when it is futile. That depends on the komi - if you're behind by fourty points and set the

Re: [computer-go] Re: Dynamic komi in commercial programs

It's not up to me to prove anything.   It's up to you. You entered a discussion in which you gave arguments (that I believe are nonsense) against this method, which I just meant to counter. But I don't want to prove anything (well I might want, but I know I cannot). I'm really just curious about

Re: [computer-go] Re: Lisp time

Getting back to the CL vs. Scheme question, I think starting with Scheme is a perfectly reasonable choice as it is much more student-friedy (as long as you don't look at continuations too soon). Personally, I now prefer CL because of the multiple namespaces for different things (I can have a

Re: [computer-go] MC-UCT and tactical information

I believe it's not a good idea just to store the number of stones of a conditionally alive string - what you really want is a good estimation for the endgame value of capturing / escaping, which can be quite different depending on how much points, influence or nearby weak groups are effected by

Re: [computer-go] Drunken sailor on payday

Full agreement - I'll write more later when I find the time :) ___ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/

Re: [computer-go] Re: more on languages

How about this conclusion: We all know that the choice of language depends on what you want to do with it. There are dynamic, well-supported but slow languages with many libraries like Ruby or Perl, which I'd want to use for something that doesn't need too heavy computation like GUI or web

Re: [computer-go] Drunken sailor on payday

is the state of common lisp these days?What is fastest compiler for X86 and how does it compare to C code in performance? I was either going to experiment with Forth or lisp in the near future. I will get around to both eventually. - Don Stefan Nobis wrote: Benjamin Teuber [EMAIL

Re: [computer-go] Drunken sailor on payday

Maybe this link is a bit more interesting.. http://shootout.alioth.debian.org/gp4/benchmark.php?test=alllang=sbcllang2=gcc On Nov 23, 2007 12:30 AM, Benjamin Teuber [EMAIL PROTECTED] wrote: Of course it's not easy to compare speed of different languages, but e.g. http

Re: [computer-go] Drunken sailor on payday

On Nov 21, 2007 10:22 PM, Stefan Nobis [EMAIL PROTECTED] wrote: Hmmm... you are just describing Common Lisp. :) Man, we really need a complete Common Lisp Go Framework which also has some fast low-level code to show all these C gurus its true power :) Maybe we should really think of a project

Re: [computer-go] Re: compiler optimizations

Why should a super-sophisticated compiler with algebraic type inference not be able to do this one day? On Nov 22, 2007 12:36 AM, Dave Dyer [EMAIL PROTECTED] wrote: Arguments about the quality of compiler optimizations vs. hand coding are pointless, because programmers optimize programs in

Re: [computer-go] Language

On Nov 17, 2007 12:28 PM, terry mcintyre [EMAIL PROTECTED] wrote: 1) are there any open-source computer Go efforts in lisp? I started with http://sourceforge.net/projects/cl-go a while ago, but I didn't work on it recently and I don't have a clue what the other guys did with the code when I

Re: [computer-go] OT: XML [was fairly OT: Language]

You could use YAML/JSON to keep all information without all XML overhead.. *: The first thing I do with most XML files that I need to do anything serious with is turn them into a csv file (unless the data is genuinely hierarchical, and collapsing it is unreasonable, but that is rare)

Re: [computer-go] Language

On Nov 13, 2007 5:10 PM, William Harold Newman [EMAIL PROTECTED] wrote: Also Prolog may be in a higher obscurity class than the others: unlike even the most obscure languages listed above, I don't know any serious applications which are maintained in Prolog today. I think at least one route

Re: [computer-go] Language

On Nov 13, 2007 10:18 PM, Nick Apperson [EMAIL PROTECTED] wrote: With the next generation of C++ with variadic templates I think C++ may overtake Lisp for metaprogramming, but I don't know enough to really make that claim. I don't know about variadic templates, but in general it is almost

Re: [computer-go] Language

On Nov 14, 2007 12:18 AM, Don Dailey [EMAIL PROTECTED] wrote: Common lisp? Does it have xml libraries? - Don http://www.google.de/search?q=common+lisp+xml ___ computer-go mailing list computer-go@computer-go.org

Re: [computer-go] use for Monte Carlo on 19X19?

For scoring, you could use integral instead of boolean outcomes again, which would solve some of the problems you descibed... This might be a great idea for programs that must deal with Japanese scoring, but for our reseach the best thing is just to stick to Chinese rules :) On 11/5/07, Don

Re: [computer-go] Rapid action value estimation

I don't think there's something different at different depths in the tree.. To update RAVE after a simulation, for each child of a node you visited during that simulation, you update if the move leading to the child was played later (until the end of the playout). Then, always when you calculate

Re: [computer-go] Rapid action value estimation

I store it in the normal uct tree, so that each node has variables raveVisits and raveWins besides uctVisits and uctWins. So a node in the UCT-DAG can either represent a position or a move. On 11/2/07, Christoph Birk [EMAIL PROTECTED] wrote: On Fri, 2 Nov 2007, Benjamin Teuber wrote: I don't

Re: [computer-go] Former Deep Blue Research working on Go

Quite interesting, but after all, it completely neglects the difficulties to a) determine the life status of groups b) build an evaluation function out of this Benjamin Joshua Shriver schrieb: Found this link and thought you all might find it interesting.

Re: [computer-go] Differences..

I think we already had that discussion once... These rules completely screw up the notion of territory, as e.g. three single points are better than one three-point-block. My proposal would be a fifth rule that instead of moving you are allowed to return one prisoner. But then, you could as

Re: [computer-go] Who else uses Hashtables in UCT?

I guess once superko really matters for programs, this paper might become interesting for us: http://www.fun.ac.jp/~kishi/pdf_file/AAAI04KishimotoA.pdf Regards, Benjamin I use the simple ko position as part of the hash key, and generally ignore positional superko and situational superko when

Re: [computer-go] Explanation to MoGo paper wanted.

But you can improve the prior probabilities of your search function by remembering shapes (hopefully more abstract ones in the future, including more knowledge about the neighbourhood) that seemed like good moves before, so I don't share your opinion. Whether or not this knowledge shout also be

Re: [computer-go] Explanation to MoGo paper wanted.

And how much would generating patterns from pro games be cheating? How about a system that gives a reward to shapes it actually played in a game, the pro games are then used as seed to start the system.. ___ computer-go mailing list

Re: [computer-go] Explanation to MoGo paper wanted.

I have build just for fun a simple BackGammon engine. [...] Interesting - did you also try it for chess, or do you think there's no point in this? Regards, Benjamin ___ computer-go mailing list computer-go@computer-go.org

Re: [computer-go] Congratulations to GNU and to MoGoBot19!

I don't think so - with a basic time x and a per-more time y you can freely adjust the fischer time setting to both short games and games where there's more time in the beginning. Regards, Benjamin Antonin Lucas schrieb: (I agree that Fischer time is superior for go, but it may take a

Re: [computer-go] Why not forums?

Hi, So this is all about flexibility -- nearly all web forum software are really jails with no easy alternative access, but with mailing lists you have plenty of alternatives (including your own web server with your forum software into which you can inject all these mails). I agree. Setting

Re: [computer-go] computer Go article in The Economist

Peter Drake wrote: The author is presumably Chris Lydgate, who interviewed me on this. (Did he interview other people on this list.) He asked about my experience playing against Mogo, as I mentioned my losses here - but he didn't react to my answer, which seems a bit strange to me. It's

[computer-go] Useless moves in the endgame

I just lost my first game against MoGo on KGS, 9x9, 0.5 komi, I was white. Impressing! But as a human, you don't like the useless endgame-moves MC-programs play against you when they know they win anyways. In order to make these programs more attractive for humans, I would like them to play the

Re: [computer-go] language choices

To me, computer go programming means basic research for now, as I don't believe the existing algorithms get you very far (I may be too ambitious, but I cant help it..). Thus, I would program in a way that let's me explore everything very fast, without caring too much about performance. This is