Chess Move Validation in Assembly in Bytes Play Hole
1st in Assembly and 25th overall.
Last tested .
Runtime of .
| Bytes | Chars | Submitted |
|---|---|---|
| 160 | ||
| 162 | ||
| 163 | ||
| 168 | ||
| 170 | ||
| 171 | ||
| 172 | ||
| 174 | ||
| 176 | ||
| 178 | ||
| 180 | ||
| 183 | ||
| 185 | ||
| 193 |
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
📅
1st in Assembly and 25th overall.
Last tested .
Runtime of .
| Bytes | Chars | Submitted |
|---|---|---|
| 160 | ||
| 162 | ||
| 163 | ||
| 168 | ||
| 170 | ||
| 171 | ||
| 172 | ||
| 174 | ||
| 176 | ||
| 178 | ||
| 180 | ||
| 183 | ||
| 185 | ||
| 193 |