It is currently Sun May 04, 2025 12:58 pm

All times are UTC - 8 hours [ DST ]




Post new topic Reply to topic  [ 35 posts ]  Go to page Previous  1, 2
Author Message
Offline
 Post subject: Re: Go has a problem with
Post #21 Posted: Sun Jul 10, 2016 8:25 am 
Dies in gote

Posts: 31
Liked others: 1
Was liked: 5
Rank: about 15k
KGS: ericf
Monadology wrote:
Arimaa, though it was deliberately designed to have a high branching factor.


Yes, Arimaa has a branching factor of about 20k which is bigger than go with about 400, but I'm thinking bigger! For example if you were allowed to play an arbitrary number of stones in go then the maximum branching factor would be about 2^400 which quite a bit larger. I'm wondering if such games exist and are playable.

edit: http://senseis.xmp.net/?OtherGamesConsi ... ogrammable has a discussion of this, but doesn't really seem to solve it, except perhaps for "mind ninja" which has a very high branching factor on the first move but then settles down (I think), so doesn't seem that complex, by my definition.

Top
 Profile  
 
Offline
 Post subject: Re: Go has a problem with "game tree complexity snobbery"
Post #22 Posted: Sun Jul 10, 2016 9:45 am 
Lives with ko

Posts: 129
Liked others: 20
Was liked: 17
Jhyn wrote:
The main reason I was happy to see AlphaGo win the last computer-mankind match is that I hope we would lose the whole "chess is a puny game for computers, and Our Game is a noble endeavour of poetry and zen" attitude.

Haha yeah, my feelings exactly.

Top
 Profile  
 
Offline
 Post subject: Re: Go has a problem with "game tree complexity snobbery"
Post #23 Posted: Sun Jul 10, 2016 10:04 am 
Gosei

Posts: 1596
Liked others: 891
Was liked: 533
Rank: AGA 2k Fox 3d
GD Posts: 61
KGS: dfan
If there are an infinite number of choices for each (or even just one) move, then voilà, the number of possible games is infinite.

Examples:

(I am not claiming that any of these are good games.)

Top
 Profile  
 
Offline
 Post subject: Re: Go has a problem with "game tree complexity snobbery"
Post #24 Posted: Sun Jul 10, 2016 10:18 am 
Dies in gote

Posts: 31
Liked others: 1
Was liked: 5
Rank: about 15k
KGS: ericf
dfan wrote:
If there are an infinite number of choices for each (or even just one) move, then voilà, the number of possible games is infinite.

Examples:

(I am not claiming that any of these are good games.)


The problem with infinite boards is that the game never ends (as well as the cost of materials to build them).

Top
 Profile  
 
Offline
 Post subject: Re: Go has a problem with "game tree complexity snobbery"
Post #25 Posted: Sun Jul 10, 2016 11:54 am 
Lives in sente

Posts: 1223
Liked others: 738
Was liked: 239
Rank: OGS 2d
KGS: illluck
Tygem: Trickprey
OGS: illluck
hyperpape wrote:
I don't see why. I'm more or less agreeing with Jhyn. Game tree complexity is mostly irrelevant, in my opinion. Or at least, it's hard to say how it relates--I said I think any great abstract game needs to be complex enough that humans can't exhaustively search, but that's a very low bar.


Perhaps that's where a bit of misunderstanding is coming from. I see Robert's remark as a direct response to Jhyn. Whether or not you agree with Jhyn, it's a bit strange to question Robert for discussing game complexity as a separable attribute when he was responding directly to a statement that did the same thing (which you in fact agree with).

With regards to whether complexity is irrelevant, I can see your point, but also suspect that we can actually feel the difference between "complex enough" games even if they are all beyond our ability to completely solve. For example, even 5x5 is complex enough that humans can't exhaustively search without the aid of computers, but 9x9 and 19x19 feel considerably more complex (and in my opinion, much more interesting). There are definitely other factors at play (e.g. balance between third and fourth line), but having played 15x15, I definitely think there is more depth and allure in 19x19 comparatively. Not quite sure whether expanding the board further would make the game more interesting - possibly the added game length and the already astronomical complexity of 19x19 doesn't really make it worthwhile, but wouldn't be surprised if it turns out that 21x21 and even larger board sizes could be amazing if they become popular.

p.s. I agree that your statement wasn't a personal attack, just didn't really want to steer the discussion down that route.

Edit: Changed "territory and influence" to "third and fourth line".

Top
 Profile  
 
Offline
 Post subject: Re: Go has a problem with "game tree complexity snobbery"
Post #26 Posted: Sun Jul 10, 2016 12:11 pm 
Lives with ko

Posts: 202
Location: Santiago, Chile
Liked others: 39
Was liked: 44
Rank: EGF 1d
Universal go server handle: Jhyn
illluck wrote:
Relating to 2. and P.S., perhaps that's a question better directed towards Jhyn, who stated that: "the large game tree complexity of go when this is unrelated, or only tangentially related, to what makes the game great." rather than either Robert or I :p As far as I can tell, Robert meant to disagree with that statement and chose to discuss under the same assumption (that you can consider "complexity" as one particular attribute of a game).


I fail to see where I appeared to be mocking Robert (which was definitely not my intention), so if you can point to what I said that gave you this impression, I would appreciate it.

Robert disagreed with the sentence that you quote, and while I technically agree with him, he associated a meaning to my sentence that I did not intend in this context. This is why I tried to clarify what I meant in my next post. You seem to ignore this second post and quote again my first post to say something I did not mean.

Quote:
if Go were to be straightforward (not complex) it would cease to be a great game?


The short answer is: less combinatorially complex is not straightforward, in the same way that a slightly greyer shade of black is not white.

_________________
La victoire est un hasard, la défaite une nécessité.

Top
 Profile  
 
Offline
 Post subject: Re: Go has a problem with "game tree complexity snobbery"
Post #27 Posted: Sun Jul 10, 2016 12:52 pm 
Lives in sente

Posts: 1223
Liked others: 738
Was liked: 239
Rank: OGS 2d
KGS: illluck
Tygem: Trickprey
OGS: illluck
Jhyn wrote:
I fail to see where I appeared to be mocking Robert (which was definitely not my intention), so if you can point to what I said that gave you this impression, I would appreciate it.


I did not imply that you were mocking Robert :p Apologies if my phrasing is unclear.

Jhyn wrote:
The short answer is: less combinatorially complex is not straightforward, in the same way that a slightly greyer shade of black is not white.


Sorry - I tl;dr'd your second post initially as the intent of my first post was to defend Robert's response to your first post. I don't fully agree with your second post (please refer to my previous post - I would expect the game tree complexity of chess to be closer to 13x13), but understand your frustration for my continued quote of your initial post which you clarified in your second. Again, the intent was to give context to Robert's statement rather than critize yours (and I can definitely see the point of your second post even though I slightly disagree).

Top
 Profile  
 
Offline
 Post subject: Re: Go has a problem with "game tree complexity snobbery"
Post #28 Posted: Mon Jul 11, 2016 11:49 am 
Lives with ko

Posts: 202
Location: Santiago, Chile
Liked others: 39
Was liked: 44
Rank: EGF 1d
Universal go server handle: Jhyn
illluck wrote:
Sorry - I tl;dr'd your second post initially as the intent of my first post was to defend Robert's response to your first post. I don't fully agree with your second post (please refer to my previous post - I would expect the game tree complexity of chess to be closer to 13x13), but understand your frustration for my continued quote of your initial post which you clarified in your second. Again, the intent was to give context to Robert's statement rather than criticize yours (and I can definitely see the point of your second post even though I slightly disagree).


All right, thank you for your clarification (also I can see how the second part of my post could be seen as an answer to Robert's statement, which it was not).

I don't think 13x13 or 15x15 go are "19x19 with less combinatorial complexity". Other aspects of the game, for example the fuzzy notion of the "strategy/tactics balance", are also changed. I have heard many times the argument that 19x19 hits a sweet spot in terms of this balance; this is not a mathematical proof but as you said 21x21 is not really played, and I tend to believe adding more intersections will yield diminished returns. In short, I agree with hyperpape: we can't measure the effect of more or less complexity all other things being equal, so we have a discussion about intuitions and impressions with no definitive answer.

In short, I think using the complexity argument to claim a kind of objective superiority between games is an error, because many other aspects of the game are more important with regards to what it brings to us; I see it as similar as claiming Bach is superior to any other compositor because his music is more complex. I have no problem if you prefer Bach, but this is a lazy (and falsely objective) argument imo.

_________________
La victoire est un hasard, la défaite une nécessité.


This post by Jhyn was liked by: illluck
Top
 Profile  
 
Offline
 Post subject: Re: Go has a problem with "game tree complexity snobbery"
Post #29 Posted: Mon Jul 11, 2016 2:07 pm 
Lives in sente

Posts: 1223
Liked others: 738
Was liked: 239
Rank: OGS 2d
KGS: illluck
Tygem: Trickprey
OGS: illluck
Jhyn wrote:
In short, I think using the complexity argument to claim a kind of objective superiority between games is an error, because many other aspects of the game are more important with regards to what it brings to us; I see it as similar as claiming Bach is superior to any other compositor because his music is more complex. I have no problem if you prefer Bach, but this is a lazy (and falsely objective) argument imo.


I agree (and I suspect Robert also thinks it's silly to claim Go is objectively superior to Chess due to complexity since he clearly stated that both are outside human capacity). Personally, I think complexity of 19x19 does add to the game (though I do get overwhelmed by its size pretty often). I definitely agree that there is more to just complexity since I also prefer 9x9 over 13x13 - can't really say why exactly, just that the "balance" of 13x13 feels a bit off to me (whereas 9x9 isn't really about balance). When comparing between 13x13 and 19x19 I feel like the "depth" component is more important to me than the "balance" component, but of course this varies by person.

Top
 Profile  
 
Offline
 Post subject: Re: Go has a problem with "game tree complexity snobbery"
Post #30 Posted: Mon Jul 11, 2016 3:23 pm 
Beginner

Posts: 16
Liked others: 0
Was liked: 5
Rank: Cake
The go game tree is complex, that some people are enthusiastic about it, well I don't see that as a problem.

There are many 'problems' in the go community, one, for instance, might be 'amateur syndrome', people who say they want to improve, but really just want to play for fun.
Instead of doing things like counting, and making sensible plays, they like to get into crazy fights because it is fun, then they'll complain how they are stuck at X level, and when they get a review that tells them where they made mistakes they take it personally and decide to ignore it, and do whatever they want anyway. And if someone says something, they'll point out how it is wrong because pros do X all the time, etc.

Is it a problem? Not really, everyone engages with go at some level, and for the individual it may be annoying that they don't increase they're level, but then they play another game and get into a fight, and kill a big group and feel better anyway.

If someone is excited about the game tree complexity, just give them a high five, and then play a game with them.

Accept that the game tree complexity in go is mind boggling, and let it go.


This post by aiichigo was liked by 2 people: Fool, goTony
Top
 Profile  
 
Offline
 Post subject: Re: Go has a problem with "game tree complexity snobbery"
Post #31 Posted: Mon Jul 11, 2016 11:02 pm 
Judan

Posts: 6269
Liked others: 0
Was liked: 796
illluck wrote:
I suspect Robert also thinks it's silly to claim Go is objectively superior to Chess due to complexity


Complexity has several aspects. For some complexity aspects, Go is superior to Chess (among them: it requires more AI techniques to let a program beat a top player) - for others, the two games are equal. Complexity is just one of the topics that can make games interesting.


This post by RobertJasiek was liked by: goTony
Top
 Profile  
 
Offline
 Post subject: Re: Go has a problem with "game tree complexity snobbery"
Post #32 Posted: Wed Jul 13, 2016 4:36 pm 
Lives in gote

Posts: 349
Location: Washington State
Liked others: 272
Was liked: 60
Rank: OGS 11kyu
KGS: gotony
OGS: nghtstalker
The number of first move possibilities is 361, but please keep in mind that most people do not play on the first line or second since it generally does not lead to a good outcome. So just quoting numbers does no good. Chess has 20 possible opening moves. But some are not used because of the weakness thereof. Both games have a complexity that dwarfs the human minds ability to fully grasp. And that is why we have GO and Chess tournaments and not tic tac toe....

_________________
Walla Walla GO Club -(on FB)

We play because we enjoy the beauty of the game, the snap and feel of real stones, and meeting interesting people. Hope to see ya there! お願いします!

Anthony

Top
 Profile  
 
Offline
 Post subject: Re: Go has a problem with "game tree complexity snobbery"
Post #33 Posted: Wed Jul 13, 2016 10:01 pm 
Gosei

Posts: 1543
Liked others: 111
Was liked: 324
I think that the problem is now dead. It was the case that Go players would overstate this complexity aspect, lumping in the pants-on-a-stick ability of the state of the art software alongside. Such days are past.

_________________
North Lecale

Top
 Profile  
 
Offline
 Post subject: Re: Go has a problem with "game tree complexity snobbery"
Post #34 Posted: Thu Jul 14, 2016 6:59 am 
Judan

Posts: 6727
Location: Cambridge, UK
Liked others: 436
Was liked: 3720
Rank: UK 4 dan
KGS: Uberdude 4d
OGS: Uberdude 7d
Something which narked me slightly in all the AlphaGo press was the "Go is so complex, there are more games than atoms in the universe" spiel. I seem to recall Demis Hassabis said this in his presentations as well as being reported in newspaper/website articles. That atoms in the (observable) universe number is about 10^80, which is less than chess complexity (about 10^120) so it's rather a naff comparison. If every atom in the universe was replaced with a copy of the universe, and then every atom in those copies was replaced with another copy of the universe and then every atom in those copies of copies was replaced with a copy of the universe and you then counted all the atoms in those 4 levels of universes, then you'd have about 10^360 atoms which is Go's complexity. Exponentiation makes big numbers!

Top
 Profile  
 
Offline
 Post subject:
Post #35 Posted: Thu Jul 14, 2016 11:13 am 
Honinbo
User avatar

Posts: 8859
Location: Santa Barbara, CA
Liked others: 349
Was liked: 2076
GD Posts: 312
  • There are more Go games than atoms in the universe;
  • There's more money in the US national debt than a penny;
  • There are more grains of sand on earth than one grain of sand.

biggie

Top
 Profile  
 
Display posts from previous:  Sort by  
Post new topic Reply to topic  [ 35 posts ]  Go to page Previous  1, 2

All times are UTC - 8 hours [ DST ]


Who is online

Users browsing this forum: Majestic-12 [Bot] and 1 guest


You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot post attachments in this forum

Search for:
Jump to:  
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group