Timeline for Tic Tac Toe: print all possible positions without duplicates
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 24, 2019 at 22:26 | comment | added | Chas Brown | @ArtemisFowl Yup, this was before I discovered TIO - easy to make counting errors! | |
| Nov 24, 2019 at 22:25 | history | edited | Chas Brown | CC BY-SA 4.0 |
added 789 characters in body
|
| Nov 24, 2019 at 14:35 | comment | added | Miriam | Old post I know, but this seems to be 623 bytes? You can replace the second level of indentation (2 spaces) with a single tab for 620 bytes, maybe you meant to do this? | |
| Jul 28, 2017 at 17:51 | comment | added | Adalynn |
That big long return can be return 0if d not in[0,1]else 0if w and v else(x*(d==1))if w else(o*(d==0))if v else'.'if'.'in b else'/'
|
|
| May 28, 2017 at 7:12 | comment | added | Chas Brown | @ovs : so noted! | |
| May 28, 2017 at 7:10 | history | edited | Chas Brown | CC BY-SA 3.0 |
added 35 characters in body
|
| May 28, 2017 at 6:48 | comment | added | ovs |
I don't thonk you need the Counter. You can replace it with c=b.count;d=c(x)-c(o)
|
|
| May 28, 2017 at 6:24 | history | edited | Chas Brown | CC BY-SA 3.0 |
added 6 characters in body
|
| May 28, 2017 at 6:14 | history | answered | Chas Brown | CC BY-SA 3.0 |