integers in the range [0, 15] fit entirely in the bit mask 0x000F. integers out of that range will have at least one bit 0x0010 or higher, or will have the sign bit 0x8000 set. so to find out if one of two numbers is out of range [0, 15], we can check the bit mask of their bitwise or.
this saves tokens and cycles. it is also completely illegible. very in the spirit of Pico-8, I love it.
Rope rewrite, part one
We should only care about anchors on the old path
Add comment expressing uncertainty
Add further algo notes
One final note
Well, this is closer to right!!
Elide points as needed
Save current changes
First version I couldn't immediately break
Everything _seems_ to work
Clean up some residual messes
Tidy up more loose ends
Co-authored-by: Nyeogmi <economicsbat@gmail.com>
Reviewed-on: #11
Also adds a placeholder level 8, which will eventually become my general physics experimentation box and I'll start making levels in 9 and later.
Reviewed-on: #9
Co-authored-by: Kistaro Windrider <kistaro@gmail.com>
Co-committed-by: Kistaro Windrider <kistaro@gmail.com>
Add "dotted lines" spacing out level placement in the map. Also crudely drawn ID numbers.
Write a crappy level selector for debug/dev purposes.
Reviewed-on: #8
Co-authored-by: Kistaro Windrider <kistaro@gmail.com>
Co-committed-by: Kistaro Windrider <kistaro@gmail.com>
