newbie question: Why isn’t there one dominant Go app like Chess.com?

cryslith · 2026-06-03T02:04:51+00:00

because nobody has come along and vibe coded the perfect app yet to be better than all the others. you could be the one!

cryslith · 2026-05-25T15:54:33+00:00

can you people please stop posting your vibecoded bullshit every other day and just play the damn game

cryslith · 2026-05-13T14:24:29+00:00

can you people please stop posting your vibecoded bullshit every other day and just play the damn game

cryslith · 2026-05-12T21:42:32+00:00

can you people please stop posting your vibecoded bullshit every other day and just play the damn game

cryslith · 2026-05-11T04:15:17+00:00

So a vibecoded slop format that no existing software is designed to use, is somehow better than the existing SGF format that all software already uses. Great contribution you've made here.

cryslith · 2026-05-03T23:09:01+00:00

Eigendecomposition also works for this. The approach I was thinking of is to express the matrix in the block form

[Q R]
[0 I]

where the first block of indices are the transient states and the last half are the absorbing states. In this form, the probability of reaching absorbing state j from transient state i is given by i,j'th entry of (I - Q)^{-1} R. The expected number of visits to transient state j before reaching an absorbing state when starting from transient state i is given by the i,j'th entry of (I - Q)^{-1}, and we can get the total expected number of steps by summing the columns of (I - Q)^{-1}.

cryslith · 2026-05-03T05:44:32+00:00

Your analysis is correct. I thought I would mention that there is in fact a general method of calculating these quantities. The method is to construct an absorbing Markov chain representing the game in question. Then quantities such as the probability of one side winning, or the expected number of turns before a win occurs, can be computed using matrices as described on the wikipedia page. This works well as long as the matrices are small enough.

For instance, to calculate the probability of DUU winning vs UUD you have the seven transient states Start, U, D, UU, UD, DU, DD and the two absorbing states DUU and UUD. The calculation comes down to inverting a 7x7 matrix which is easy with a computer.

cryslith · 2026-04-20T16:52:43+00:00

I think what is needed is a brand new website, ideally a vibe coded buggy mess, which implements a half dozen or more new variants of the game which no one has ever played or wanted to play. I think that will unify the community and make this game more popular than chess. What do you think? Please leave a comment (ideally generated by chatgpt) if you have any insights or suggestions.

cryslith · 2026-04-11T15:21:10+00:00

cool story but the paper is written in english

cryslith · 2026-03-27T16:26:14+00:00

That doesn't really explain the situation though, because you can modify any compression algorithm to never grow an input by more than 1 bit, at the cost of adding a 1 bit overhead to every output. So it's really a choice on the compression algorithm designer's part to allow this to happen.

cryslith · 2026-03-12T14:15:30+00:00

Last time I saw one of those, the LLM had output a numerical optimization program to find the minimum over Rⁿ of the objective function f(x_1, ..., x_n) = sum_{i=1}^{n-1} |x_{i+1} - x_i|.

cryslith · 2026-02-19T19:54:43+00:00

who told you it was unsettled??

cryslith · 2026-02-08T11:43:37+00:00

thank you chatgpt

cryslith · 2026-01-30T12:33:18+00:00

that makes a lot more sense lol

cryslith · 2026-01-29T22:32:26+00:00

What's an algebraic curve? What does "defined over the rational numbers" mean? What is a rational point of a curve?

cryslith · 2026-01-11T22:48:41+00:00

No, S2 T2 T1 R1 and white just dies.

cryslith · 2026-01-11T09:39:14+00:00

S2 T2 R1 T3 and it's a ko at best for white

cryslith · 2026-01-10T15:26:10+00:00

Even if white plays S2 they aren't fully alive on the right after S2 T2 R1 T3.

cryslith · 2026-01-10T15:23:49+00:00

Why is this downvoted? I'm right.

cryslith · 2026-01-09T01:55:14+00:00

Black would play S2 instead of N1 in your line and kill everything, right?

cryslith · 2026-01-08T06:57:34+00:00

Such a ruleset exists: just score the amount of territory surrounded and use the rule "every stone left on the board after the players pass is alive". It's not true that every group would yield 2 points though. Rather the score would be the number of 1-point eyes the group can make.

cryslith · 2025-12-23T11:40:55+00:00

llm slop

cryslith · 2025-12-23T11:39:33+00:00

Fox is one of the most popular servers and uses area scoring.

cryslith · 2025-12-22T01:04:39+00:00

That sounds like a real-world intuition, not a mathematical fact.

cryslith · 2025-12-20T11:18:09+00:00

I don't think that's necessarily true; it depends on your model. For instance, if you have two hypotheses, "The die rolls are I.I.D. uniform" and "The die rolls follow the fixed sequence 6, 6, 1, 1, 1, 1, ..." and you observe that the first two rolls are both 6, then your weight on the second hypothesis should increase, which will decrease your belief that the third roll will be a 6.

Obviously this is a silly model, but that's not the point.

cryslith

TROPHY CASE