Assuming you don't account for reflections, rotations, and 'unreachable' gamesta... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		dpoloncsak 9 days ago \| parent \| context \| favorite \| on: What's the strongest AI model you can train on a l... Assuming you don't account for reflections, rotations, and 'unreachable' gamestates where a player wins and you continue to mark boxes. It's just 3^9, right? 9 boxes, either X,O, or blank? We're only at 19,683 game states and would trim down from here if we account for the cases above.

rkomorn 9 days ago [–]

Exactly, but then we may as well say "don't solve this with an LLM" which sort of kills the conversation altogether and that's not my goal. :)

dpoloncsak 9 days ago | [–]

Oh, im sorry! I was just trying to give a quick perspective of how small that tic-tac-toe data-set actually is. Not suggest against the idea!

rkomorn 9 days ago | | [–]

Oh no worries at all. :)

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact