117
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
this post was submitted on 12 Dec 2024
117 points (100.0% liked)
Ask Lemmy
27253 readers
1718 users here now
A Fediverse community for open-ended, thought provoking questions
Rules: (interactive)
1) Be nice and; have fun
Doxxing, trolling, sealioning, racism, and toxicity are not welcomed in AskLemmy. Remember what your mother said: if you can't say something nice, don't say anything at all. In addition, the site-wide Lemmy.world terms of service also apply here. Please familiarize yourself with them2) All posts must end with a '?'
This is sort of like Jeopardy. Please phrase all post titles in the form of a proper question ending with ?3) No spam
Please do not flood the community with nonsense. Actual suspected spammers will be banned on site. No astroturfing.4) NSFW is okay, within reason
Just remember to tag posts with either a content warning or a [NSFW] tag. Overtly sexual posts are not allowed, please direct them to either !asklemmyafterdark@lemmy.world or !asklemmynsfw@lemmynsfw.com. NSFW comments should be restricted to posts tagged [NSFW].5) This is not a support community.
It is not a place for 'how do I?', type questions.
If you have any questions regarding the site itself or would like to report a community, please direct them to Lemmy.world Support or email info@lemmy.world. For other questions check our partnered communities list, or use the search function.
6) No US Politics.
Please don't post about current US Politics. If you need to do this, try !politicaldiscussion@lemmy.world or !askusa@discuss.online
Reminder: The terms of service apply here too.
Partnered Communities:
Logo design credit goes to: tubbadu
founded 2 years ago
MODERATORS
A computer program winning a Go tournament.
In chess, human grandmasters routinely beat the best computers, but changing that was simply a matter of faster processors and larger memory, problems solvable by the application of sufficient quantities of money. In principle the game was already solved, and within a few decades, would be solved in practice as well.
Go was considered a much harder problem. Programs of similar complexity to a decent chess program couldn't even look at a finished game between go pros and reliably say who won, let alone get there itself. Well, guess what?