Re:Ask HN: What's your favorite elegant/beautiful algorithm?
by packetpirate on Wednesday October 17, 2018 @04:06PM
(#18243226)
I thought I had an original and clever solution to TTT... my solution was to define all winning combinations as sets of (x,y) coordinate pairs and each time a player made a move, check to see if any of the winning combinations was a subset of the player's set of coordinate pairs.
[ Parent
| on HN ]
There are no comments on this comment yet.