9
Last seen 2 years ago
Member for 9 years, 3 months, 22 days
Difficulty Normal
Thank you very much for this awesome idea! I've created the "[Star Wars](http://www.checkio.org/mission/i-love-python/publications/zlomovsky/python-3/my-star-wars/)", which is based on your code.
More
I've done [the same](http://www.checkio.org/mission/absolute-sorting/publications/zlomovsky/python-3/very-short/). I just was usung "a" instead of "n". :)
More
Looks like I've done [shortest lambda](http://www.checkio.org/mission/count-neighbours/publications/zlomovsky/python-3/lambda-91/) (91 characters). :)
More
Since anybody knows that there is 8 winning combinations, I think it's a good idea to create a list which contains these combinations and just loop through the list to check if a list item is containing Xs or Os.
More
Based on and inspired by veky’s [Magnum opus](http://www.checkio.org/mission/i-love-python/publications/veky/python-3/magnum-opus/), Guido's foreword for "Programming Python", and [Star Wars JAPH](http://www.cpan.org/misc/japh).
More
Sorry for my errors in the essay. I know I have awful English, but re-editing the solution for the 4th or 5th time is beyond my ken.
More
Lol. I didn't know that I can use word.isalpha() instead of checking the word against a regular expression. It would be a lot clearer and shorter without a RegExp.
More