Re: [Computer-go] Indexing and Searching Go Positions -- Literature Wanted

At 07:07 AM 9/17/2019, Brian Sheppard via Computer-go wrote: >I remember a scheme (from Dave Dyer, IIRC) that indexed positions based on the >points on which the 20th, 40th, 60th,... moves were made. IIRC it was nearly a >unique key for pro positions. Correct, but it's only u

Re: [Computer-go] Indexing and Searching Go Positions -- Literature Wanted

At 07:07 AM 9/17/2019, Brian Sheppard via Computer-go wrote: >I remember a scheme (from Dave Dyer, IIRC) that indexed positions based on the >points on which the 20th, 40th, 60th,... moves were made. IIRC it was nearly a >unique key for pro positions. Correct, but it's only u

Re: [Computer-go] Crazy Stone is back

At 06:31 AM 3/5/2018, valky...@phmp.se wrote: >My guess is that there is some kind of threshold depending on the relative >strength of MC eval and the value function of the NN. My experiments suggest it's better to train with much longer MCTS time than will be used in actual play, so the MCTS va

Re: [Computer-go] MCTS with win-draw-loss scores

The exact meaning of the result MCTS returns is irrelevant. The net should just learn it. ___ Computer-go mailing list Computer-go@computer-go.org http://computer-go.org/mailman/listinfo/computer-go

Re: [Computer-go] difficult things for alphazero

At 08:05 AM 12/8/2017, Jim O'Flaherty wrote: >Dave, > >To whom is the "your" in your first sentence referring? There is no context >from which to derive to whom you are speaking. Sorry, it was "your" reference to Abchij, but I intended it to be about any attempt to make games that are difficult f

Re: [Computer-go] difficult things for alphazero

Without reference to your specific ideas for games that might be difficult to solve, I wonder where these games fit on the human playability scale. The things we find acceptable as games are in a pretty small domain, which lies between the things that are trivial and the things that are too hard

Re: [Computer-go] Learning related stuff

My question is this; people have been messing around with neural nets and machine learning for 40 years; what was the breakthrough that made alphago succeed so spectacularly. ___ Computer-go mailing list Computer-go@computer-go.org http://computer-go.o

Re: [Computer-go] Is MCTS needed?

While MCTS works "better" in games with a forward direction, it eventually converges to the same answer as alpha-beta in any game. The general architecture is to set a maximum depth, and use a suitable evaluator at the leaf nodes. I haven't done detailed studies, but there is definitely a space

Re: [Computer-go] Is MCTS needed?

While MCTS works "better" in games with a forward direction, it eventually converges to the same answer as alpha-beta in any game. The general architecture is to set a maximum depth, and use a suitable evaluator at the leaf nodes. I haven't done detailed studies, but there is definitely a space

Re: [Computer-go] Alphago Zero special circumstances

I wonder how alphago-0 treats the menagerie of special positions, such as bent 4 in the corner, thousand year ko, rotating ko, etc. ___ Computer-go mailing list Computer-go@computer-go.org http://computer-go.org/mailman/listinfo/computer-go

Re: [Computer-go] Alphago Zero special circumstances

I wonder how alphago-0 treats the menagerie of special positions, such as bent 4 in the corner, thousand year ko, rotating ko, etc. ___ Computer-go mailing list Computer-go@computer-go.org http://computer-go.org/mailman/listinfo/computer-go

Re: [Computer-go] Possible idea - decay old simulations?

The tree built by MCTS is very unbalanced - some branches are explored more thoroughly than others. Tweaking the algorithm to favor the newer results might result in an overall improvement, but it also would be subject to all the pitfalls of partially or unevenly evaluated trees. This is especia

Re: [Computer-go] Possible idea - decay old simulations?

The tree built by MCTS is very unbalanced - some branches are explored more thoroughly than others. Tweaking the algorithm to favor the newer results might result in an overall improvement, but it also would be subject to all the pitfalls of partially or unevenly evaluated trees. This is especia

Re: [Computer-go] SGF

Character encoding (usually UTF8 these days) ought not to be part of the standard, it ought to be up to the containing file to describe the encoding at that level.Likewise, nothing in the standard ought to require support for particular character sets. Rather, if a sgf record contains an uns

Re: [Computer-go] Auto Go game recorder

Baduk cap does a reasonably good job of recognising where the stones are, but that's a far cry from recording a game as it progresses. It doesn't do life and death of the endgame position. ___ Computer-go mailing list Computer-go@computer-go.org http://

Re: [Computer-go] DarkForest is open-source now.

At 11:31 AM 6/10/2016, uurtamo wrote: >Compiler no workie? ;) Lazy. Lots of junk to install and get working. ___ Computer-go mailing list Computer-go@computer-go.org http://computer-go.org/mailman/listinfo/computer-go

Re: [Computer-go] DarkForest is open-source now.

Now if someone would post a binary that would just run on suitable hardware. ___ Computer-go mailing list Computer-go@computer-go.org http://computer-go.org/mailman/listinfo/computer-go

Re: [Computer-go] DarkForest is open-source now.

Now if someone would post a binary that would just run on suitable hardware. ___ Computer-go mailing list Computer-go@computer-go.org http://computer-go.org/mailman/listinfo/computer-go

Re: [Computer-go] The Game AI Forum is back

A lot of what passes through this list would be just noise on a forum, but it's good to have a public face for summaries, announcements, and items with crossover interest to other games. ___ Computer-go mailing list Computer-go@computer-go.org http://c

Re: [Computer-go] Standard Computer Go Datasets - Proposal

I was recently working on assigning final scores to completed games, using the large data set from Badukmovies.com. My observation is that the size of the data set (50,000 games) is not large enough to get good coverage of unusual situations occurring in real games. There's a definite need for

Re: [Computer-go] Standard Computer Go Datasets - Proposal

I was recently working on assigning final scores to completed games, using the large data set from Badukmovies.com. My observation is that the size of the data set (50,000 games) is not large enough to get good coverage of unusual situations occurring in real games. There's a definite need for

Re: [Computer-go] Seldom, but not alarming

>Can you tell us the rules of the game? Maybe they help to explain the >phenomenon. The game is https://boardgamegeek.com/boardgame/149910/six-making The most unusual thing I see in the UCT tree is that at all the moves seem to be evaluated about the same, right up to the point where wins sta

Re: [Computer-go] alarming UCT behavior

>I have seen this exact behavior when first experimenting with long thinking >times in Pachi. When you stop growing the tree, the algorithm degenerates to >"delayed" single-level Monte Carlo along the principal variations, with all >the MC-without-tree weaknesses. The pathology definitely depe

Re: [Computer-go] alarming UCT behavior

>But you are stopping right at the atari, and then pile on playouts that make >it seem work... Yes, something like that may be the situation that turns the result. Suppose the tree stops at a point where there are two moves, a blunder that leads to a quick end, and another move which leads to

Re: [Computer-go] alarming UCT behavior

At 11:24 AM 11/6/2015, Tobias Pfeiffer wrote: >If you remove the limit on the tree size, does this still occur? Exactly. That's why I reported the tree size limit as the likely culprit. It's still hard to imagine how that results in the observed behavior. _

Re: [Computer-go] alarming UCT behavior

At 10:59 AM 11/6/2015, Gonçalo Mendes Ferreira wrote: >That doesn't seem very realistic. This is with a well tested framework that's been used for 20+ games. Whatever the ultimate resolution, the counter intuitive result that triggered it stands alone; longer think times give worse results. I ha

[Computer-go] alarming UCT behavior

Developing a UCT robot for a new game, I have encountered a surprising and alarming behavior: the longer think time the robot is given, the worse the results. That is, the same robot given 5 seconds per move defeats one give 30 seconds, or 180 seconds. I'm still investigating, but the proximate

Re: [Computer-go] KGS bot tournaments - what are your opinions?

How about handicapping the hardware based on time. Programs running on more powerful hardware would get less time. On the other hand, improving the software includes making use of more powerful hardware. Handicapping (or banning) powerful hardware would discourage that. On third hand, develo

Re: [Computer-go] Programme NAO to play Go and talk about it

Maybe, maybe not. Current research in volition and conscious choice indicates that conscious choice is actually an after the fact explanation of decisions based on unconscious processes. I found this video about how research into visualizing neural networks led to big improvements, by showing

Re: [Computer-go] Arimaa bot notably stronger

My reading of the material currently available is that the big advance was to forward prune a lot of moves based on simple utility metrics. Moves that don't "do something" are thrown out. A reasonable idea, but the utility metrics are specific to arimaa; and even for the general idea, it's hard

Re: [Computer-go] CGOS future

Is anyone else bothered the line endings of cgos messages are being transformed, which makes everything mash onto one long line on my mail reader ? ___ Computer-go mailing list Computer-go@computer-go.org http://computer-go.org/mailman/listinfo/computer-

Re: [Computer-go] CGOS future

>It's easy to get 20+ ppl saying OMG I want to help. But I need at >least 1-2 more core devs outside me, especially if I'm working in a >language outside my zone. All I can say is, if you need 1-2 outside collaborators, you better have a plan B. Everyone dances to their own tune, and no one wa

Re: [Computer-go] house robot for Boardspace

I'm planning to add Go (for human players) to Boardspace.net soon, and I would like to have at least a minimal house robot to play on small boards. It's absolutely required that the bot be written in Java. Other than that, the main requirement is cooperation to integrate the bot into the game f

Re: [Computer-go] fast + good RNG

> >Anyway, it's very easy to make a fast PRNG these days. A couple words of caution about hacking PNRG. Back in the stone age of computing, some mavens from the triple-i movie group cooked up a "galaxy simulator" which generated pictures of spiral galaxies based on a numerical model. The ca

Re: [Computer-go] sgf reader/editor/write in java?

Read and Write is easy, I have some classes I use for all my games that I've distributed several times. Edit implies a full gui, which is a little more complicated. I have a fairly primitive board widget I've distributed in the past. If your goal is a fully featured go gui, with replay and revi

Re: [Computer-go] cgos.computergo.org down?

At 01:14 PM 3/1/2015, folkert wrote: >Hi, It looks like cgos.computergo.org is down? the server has moved back to cgos.boardspace.net ___ Computer-go mailing list Computer-go@computer-go.org http://computer-go.org/mailman/listinfo/computer-go

Re: [Computer-go] alternative for cgos

I think hosted is a bad idea - anyone developing a bot has a computer and a development environment, and it may not be linux, and the extra step of updating and installing on the host is just sand in the gears. And of course, hosting is not free. ___ Co

Re: [Computer-go] Teaching Deep Convolutional Neural Networks to Play Go

You don't need a neural net to predict pro moves at this level. My measurement metric was slightly different, I counted how far down the list of moves the "pro" move appeared, so matching the pro move scored as 100% and being tenth on a list of 100 moves scored 90%. Combining simple metrics suc

[computer-go] Re: Open source real time Go server

> > (i) IGS is derivation of NNGS, which is free software (GPLv2)! It has >even seen some slight development in past few years. I don't think that's correct - NNGS was a functional copy of IGS created by duplicating the published (telnet based) interfaces. It eventually was open sourced before

[computer-go] Re: Open source real time Go server

Back up a bit - what's your primary interest ? I can readily believe that not many "near blind" play Go on the internet now, but what makes you believe a properly supportive server would bring them out of the woods, or that FSF would be interested in supporting it? And if so, why must it be

[computer-go] OT: AI article I found interesting

At 10:12 AM 10/24/2009, Joshua Shriver wrote: >Came across this today, and since this is also an AI oriented list thought >some of you might enjoy it too. > >http://www.techradar.com/news/world-of-tec

[computer-go] Re: Rating variability on CGOS

In any rating scheme, who you play can be as important as how well. This is especially true for small groups. Suddenly adding or dropping a strong player will certainly cause all the other player's ratings to shift. ___ computer-go mailing list com

[computer-go] Re: self atari

It's easy to construct self-atari of unlimited size that both can occur and should be played, if the capturing move that follows the self-atari is then recaptured in a snapback. ___ computer-go mailing list computer-go@computer-go.org http://www.computer

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

If you are in a lost position, "good play" is play that maximizes the probability of a turnaround, which is quite different depending on how far behind you are, and for what reason. If the status of all the major groups is solid, then concentrating on tactics which can gain a few points reliably

[computer-go] Re: MCTS, 19x19, hitting a wall?

I think one approach to scaling playouts is to subdivide the board, stipulate the outcome in a fixed part, and do "norman" playout in the interesting part. The trick is to do a reasonable subdivision in the first place. Imagine an advanced UCT model that conceptually behaves like human evaluatio

[computer-go] Re: Cgos redesign

My $0.02 The choice of language is mostly arbitrary. CGOS is really two separate programs: (1) an I/O multiplexer that manages the clients connections and detailed communication, (2) a scheduler/planner/recorder that manages the overall operation of the site. I would definitely separate

[computer-go] Re: Problems with CGOS

> >So I believe this is a design flaw in CGOS itself. I wrote CGOS without >having had any experience writing servers. If there's a problem with larger databases, perhaps it can be fixed by adding the right indexes to the sql database. If you add a little time monitoring code around your q

[computer-go] Re:verifiable claims

> >And somehow I don't ever see comments anywhere suggesting that this could be a >problem. So what I'd like to know is: is this so trivial that no one ever >mentions it, or are the heuristics that programs use to terminate playouts so >obscure that they are too embarrasing to mention? Comple

[computer-go] Re:verifiable claims

> >And somehow I don't ever see comments anywhere suggesting that this could be a >problem. So what I'd like to know is: is this so trivial that no one ever >mentions it, or are the heuristics that programs use to terminate playouts so >obscure that they are too embarrasing to mention? Comple

[computer-go] Re: verifiable claims

I've written dozens of games with alpha-beta searches, so I think it's fair to say that I have a basic understanding of the process. Your description is correct but incomplete. Alpha beta is good at eliminating lines of play once a strong outcome is known somewhere in the tree, but much weaker be

[computer-go] Re: verifiable claims

At 06:31 PM 5/22/2009, David Doshay wrote: >there are no chains of size 30 on a 5x5 board, I'll concede for a 5x5 board, but I think my point is valid for "sufficiently large" boards, probably 7x7. Almost any strategy other than playing out all legal moves involves a lot of hand waving that is u

[computer-go] Re: verifiable claims

> >You can just prove that you can make a large-enough chain that is >unconditionally alive. I believe that's what Erik did. In practice, >you cannot do an exhaustive search using superko rules because then >hash table scores cannot be used. I don't think you can always do that. For example, if

[computer-go] Re: verifiable claims

Some lines of play involving large captures will effectively never terminate, even with superko rules in effect. I doubt it is possible to eliminate all these non-terminating lines of play in any way that is provably correct. .. So while claims of solution by exhaustive search might be very conv

[computer-go] Re: Implications of a CPU vs Memory trend on MCTS

>> >>But then MCTS is invalid. The point is that you do spend time learning that >>these nodes are not relevant, so you might as well try to remember that. It is invalid. It's just a heuristic that is working within the current domain. >>If you are playing a game of chess and fall for a trap

[computer-go] Re: Implications of a CPU vs Memory trend on MCTS

> >If I use persistent storage and do that search again in another game, I can >start exactly where I left off and generate 50,000 more nodes. It will be >the same as if I did 100,000 nodes instead of 50,000 nodes.Or put another >way, it will be the same as if I spent 20 seconds on thi

Re: [personal] Re: [computer-go] Re: Implications of a CPU vs Memory trend on MCTS

> >I assume Dave Dyer does not understand alpha beta pruning either, or he would >not assume the branching factor is 361. The branch at the root is about (361-move number) - you have to consider all top level moves. A/B only kicks in by lowering the average branching factor at lower le

[computer-go] Re: Implications of a CPU vs Memory trend on MCTS

An essential feature of monte carlo is that it's search space is random and extremely sparse, so consequently opportunity to re-use nodes is also extremely sparse. On the other hand, if the search close to the root is not sparse, my previous arguments about the number of nodes and the number of t

[computer-go] Re: Implications of a CPU vs Memory trend on MCTS

At 02:13 PM 5/12/2009, Michael Williams wrote: >Where does your 99% figure come from? 1/361 < 1% by endgame there are still easily 100 empty spaces on the board. ___ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailm

[computer-go] Re: Implications of a CPU vs Memory trend on MCTS

At 02:13 PM 5/12/2009, Michael Williams wrote: >Where does your 99% figure come from? 1/361 < 1% by endgame there are still easily 100 empty spaces on the board. ___ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailm

[computer-go] Re: Implications of a CPU vs Memory trend on MCTS

Storing an opening book for the first 10 moves requires 331477745148242200 nodes. Even with some reduction for symmetry, I don't see that much memory becoming available anytime soon, and you still have to evaluate them somehow. Actually storing a tree, except for extremely limited speci

[computer-go] Berlekamp lecture on mathematical Go

Highly recommended Mathematics and Go by Elwyn Berlekamp ___ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/lis

[computer-go] cgos: Donn Daily?

Donn, your email at d...@mit.edu is bouncing. ___ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/

[computer-go] Re: static evaluators for tree search

This is old and incomplete, but still is a starting point you might find useful http://www.andromeda.com/people/ddyer/go/global-eval.html General observations (from a weak player's point of view): Go is played on a knife edge between life and death. The only evaluator that matters is "is thi

[computer-go] Re: static evaluators for tree search

>Do you mean that the evaluator might be used during move ordering somehow >and that generating the nodes to expand is tightly coupled with the static >evaluator? That's the general idea. No search program can afford to use a fan-out factor of 361. The information about what to cut has to co

[computer-go] Re: static evaluators for tree search

>Do you mean that the evaluator might be used during move ordering somehow >and that generating the nodes to expand is tightly coupled with the static >evaluator? That's the general idea. No search program can afford to use a fan-out factor of 361. The information about what to cut has to co

[computer-go] Re: static evaluators for tree search

While your goal is laudable, I'm afraid there is no such thing as a "simple" tree search with a plug-in evaluator for Go. The problem is that the move generator has to be very disciplined, and the evaluator typically requires elaborate and expensive to maintain data structures. It all tends to b

[computer-go] Re: remote time measurement

At 12:59 AM 2/4/2009, David Fotland wrote: >What do you mean by operator at remote end? In my case, the program was >running on a cluster at Microsoft in some computer data center. There was >no operator at Microsoft. The cluster was operated from Beijing through a >remote desktop. The operator

[computer-go] Re: remote time measurement

My theory is that the organizers of tournaments with remote participants could appoint official observers, to observe the operators at the remote end of connections. Not foolproof, but simple and doesn't interfere with the conduct of the tournament. __

[computer-go] Re: Is computer Havannah welcome here?

There's already a "havannah" section on this game programming forum: http://www.grappa.univ-lille3.fr/ -- which could use an influx of traffic. ___ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/compute

[computer-go] Re: Hardware limits

Lets look at it another way - no one would care what hardware you choose to use, unless you win. So at the very least, you ought to be able to use arbitrary hardware until it becomes established that only that class of hardware can win. ___ computer-

[computer-go] Re: Hardware limits

I think general hardware limits are good, because they will permit more teams to be competitive without altering the nature of the competition. ___ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/comp

[computer-go] Re: hex robot

At 01:52 AM 11/27/2008, Denis fidaali wrote: ... > But what really lacks (or i wasn't able to find anyway) is a strong community > like there is for go. > > A CGOS equivalent. > A GTP equivalent. > A Gogui equivalent. > A Kgs equivalent. I don't think there's a match between your goals and what

[computer-go] RE: hex robot

Permit me to play the skeptic here; I think you're going about it absolutely backwards - unless you already have a strong algorithm which depends on 128 bit rotations, and only lack an efficient hardware engine to run it on. If your idea of fun is to really feel the bits squishing between your

[computer-go] Re: hex robot

At 01:31 PM 11/26/2008, Denis fidaali wrote: >Speaking of hex ... I really think it would be a nice intermediary game before >tackling the complexity of go. Do you know of any good community (and protocol >equivalent to GTP) where i could start to look for submitting a bot ? There are a couple o

[computer-go] Re: flash crowd from TV

> >That's impressive, especially considering the fairly long search path between >"Go" and "igowin". It happens. One day recently I was idling at boardspace.net, when in the course a few minutes the site was overrun by about 30 guests, all speaking German and wanting to play Hex. It turned ou

[computer-go] Re: Another enhancement to AMAF

Here's a chance to share an amusing and illustrative anecdote. I was working on optimizing "Goodbot", a program that plays Tantrix, and because of the nature of the game, the only way to really qualify an improvement is to run many test games against a standard opponent. At one point, I was mak

[computer-go] Re: Another enhancement to AMAF

Here's a chance to share an amusing and illustrative anecdote. I was working on optimizing "Goodbot", a program that plays Tantrix, and because of the nature of the game, the only way to really qualify an improvement is to run many test games against a standard opponent. At one point, I was mak

[computer-go] Re: OT: Harder than go?

I think the question is largely meaningless, because few games have been studied by humans (or human computer programmers) with the depth and intensity that has been achieved for games like chess and go. In general, games with many choices and no obvious strategies are good for people and bad for

[computer-go] Re: Git, any other ideas?

For those of you who use windows, I highly recommend tortoise cvs and tortoise svn, which map access to whichever repository you prefer into an incredibly useful and intuitive interface piggybacked on windows explorer. ___ computer-go mailing list compu

[computer-go] Re: Git, any other ideas?

For those of you who use windows, I highly recommend tortoise cvs and tortoise svn, which map access to whichever repository you prefer into an incredibly useful and intuitive interface piggybacked on windows explorer. ___ computer-go mailing list compu

[computer-go] Re: reference bots testing.

I suggest you add an identical RNG for testing purposes, which you will know is identical in both implementations even if it is not ideal. Run a test with a seeded random sequence which should provide identical playouts. ___ computer-go mailing list c

[computer-go] Re: Disputes under Japanese rules

The formalized rules are the "tortured details" I referred to. I've played thousands of games of Go, and I've never even seen any of those versions of the rules. The Japanese rules I refer to are the informal procedures I use every time I play, both to estimate the score during the game, and at

[computer-go] Re: Disputes under Japanese rules

>Japanese: bad. I don't think this is the case at all. The Japanese rules are just a human optimization, to avoid having to make the last 100 meaningless moves, and still arrive at the correct score with a minimum of extraneous manipulation. The tortured details, while not elegant, rarely m

[computer-go] Re: Some thoughts on the event in Leksand

>This was typically to pick up my queen, change its colour, and >> capture my rook with it. > >Now there's a feature that would make a tournament interesting... If this appeals to you, try Martian Chess or Shogi ___ computer-go mailing list computer-go

[computer-go] Re: What's happening at the European Go Congress?

I think the result "computer in hopelessly lost position resigns." is much more satisfactory than "computer in hopelessly lost position wins by playing 100 additional pointless moves" I think a human who used this tactic in a tournament situation might win the trophy, but would be unable t

[computer-go] Re: What's happening at the European Go Congress?

I think the result "computer in hopelessly lost position resigns." is much more satisfactory than "computer in hopelessly lost position wins by playing 100 additional pointless moves" I think a human who used this tactic in a tournament situation might win the trophy, but would be unable t

[computer-go] Re: Program don't start playing on CGOS

> >I'm really very weak on networking so I'm not sure what I'm actually >reading or whether this fix needs to be applied on the server end or the >client end. Any ideas is this is relevant? You also have the same problem, but with much less real information, if the client end end of the connect

[computer-go] Re: Program don't start playing on CGOS

> >I'm really very weak on networking so I'm not sure what I'm actually >reading or whether this fix needs to be applied on the server end or the >client end. Any ideas is this is relevant? You also have the same problem, but with much less real information, if the client end end of the connect

[computer-go] Re: mogo beats pro!

I watched all the games, and I must say, mogo performed really badly at the blitz games, and quite a bit better at the 1-hour game. I'd still take any claims of dan level play with lots of salt. My take-away from watching the match is that blitz performance wasn't at all representative. A human

[computer-go] Re: Java SGF Parser

> >1) Does anybody know of a good Java SGF parser out there? I have one I've used for many types of games, including Go. I've used it to represent large collections with no problems. ___ computer-go mailing list computer-go@computer-go.org http://www

[computer-go] Re: Java SGF Parser

> >1) Does anybody know of a good Java SGF parser out there? I have one I've used for many types of games, including Go. I've used it to represent large collections with no problems. ___ computer-go mailing list computer-go@computer-go.org http://www

[computer-go] re: What Do You Need Most?

Boardspace is a VPS, so CGOS is currently running as a subaccount of a VPS. Boardspace is going to be upgraded sometime in the next few months, which will allow me to add another 1GB to CGOS allocation. Or, if computer Go gets a rich sugar daddy, spending $400/yr for your own VPS would be an exc

[computer-go] Re: linux and windows

> >Of course C can be more or less platform independent if you take some care. Purely for engine code, that's true. Standard windows has APIs that are nearly compatible with xxux for command line initialization and ordinary file and network operations. If your program has ANY gui at all t

[computer-go] Re: tournaments

One possibility is to use one of the VM products that are available to host unix on a windows machine, or windows on a unix machine. VirtualBox looks particilarly promising, since it's free and available for all the common platforms. There is some performance penalty associated with the virtual

[computer-go] Re: tournaments

One possibility is to use one of the VM products that are available to host unix on a windows machine, or windows on a unix machine. VirtualBox looks particilarly promising, since it's free and available for all the common platforms. There is some performance penalty associated with the virtual

[computer-go] Re: linux and windows

At 09:29 AM 7/17/2008, David Fotland wrote: >It irks me a little that Linux people refuse to consider porting their >programs to Windows :) With cygwin, it's pretty easy to port Linux >programs. Isn't it the case that Cygwin is no help if the program has a GUI.

[computer-go] Re: linux and windows

At 09:29 AM 7/17/2008, David Fotland wrote: >It irks me a little that Linux people refuse to consider porting their >programs to Windows :) With cygwin, it's pretty easy to port Linux >programs. Isn't it the case that Cygwin is no help if the program has a GUI.

[computer-go] Re: My experience with Linux

The thing that really kills multiple platform programs are GUIs. Unless your GUI is "born" expecting to be cross platform, you're pretty much screwed. ___ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listin

[computer-go] off topic: Tobacco

> >By the way, has anyone seen the Philip Morris commercials? I believe they were forced into this as part of the extortion by the state attorneys general. It's Penance for illegally targeting young non-smokers with Joe Camel, and promoting their products while denying that they were dangero

[computer-go] Re: komi argument = silly

To a first order approximation, would changing the komi change the rankings? Presumably, programs are playing the same number of games as black and white, so any "unfair" advantage or disadvantage black has would balance out. Komi only matters when there is only one game between a pair of oppon

  1   2   >