id is the game grid where cells with the value 1 is one player, while the value 2 represents the other player. If len(set(self._grid for i in range(id_size))) = 1: If len(set(row for row in self._grid)) = 1: # If the set has lenght 1, ther is only one unique element This is the code for checking if someone has won: # Checks rows This is a tick tack toe implementation is coded up a couple of months back. Thats a better programming approach regardless of the language, but it’s still brute force.įor OP, he can see the trick but still needs to figure out how to implement simply adding the cells won’t work since it’s possible to exceed 15 and still not have a winning board. For example looping over the board rather than hard coding the tests. ( one example would be looping over a pandas df vs using vectorized approach) sometimes it’s less about the language and looking for ways of implementing math hacks or the like. There are often better approaches than hard coded brut force, in some cases it’s in the language. This would be a good example for evaluating not just python programming but approaches to programming problems. Or finding alternative approaches to avoid the brute force. At this approach there can be two lessons, how to loop over the board rather than hard coding tests. It’s a hard coded brut force approach that doesn’t scale well to larger dimensions. You mentioned “ if OP has a working a script” which he is saying he does.
0 kommentar(er)
