Chess Move Validation in Python in Bytes Play Hole
6th in Python and 15th overall.
Last tested .
Runtime of .
| Bytes | Chars | Submitted |
|---|---|---|
| 130 | 130 | |
| 132 | 132 | |
| 148 | 148 | |
| 151 | 151 | |
| 153 | 153 | |
| 155 | 155 | |
| 156 | 156 | |
| 157 | 157 | |
| 158 | 158 | |
| 162 | 162 | |
| 164 | 164 |
Please try to tie or beat helloperson-test-acc's 38 byte happy numbers' solution! It sounds impossible unless there is a very short (at most 12 bytes) magic formula (next happy, nth happy, happy gap, etc.)!!! Use PySearch to find a formula in any style!!!
⛳
133 / 133 Holes
🔣
65 / 65 Langs
🏆
106 / 116 Cheevos
📅
6th in Python and 15th overall.
Last tested .
Runtime of .
| Bytes | Chars | Submitted |
|---|---|---|
| 130 | 130 | |
| 132 | 132 | |
| 148 | 148 | |
| 151 | 151 | |
| 153 | 153 | |
| 155 | 155 | |
| 156 | 156 | |
| 157 | 157 | |
| 158 | 158 | |
| 162 | 162 | |
| 164 | 164 |