Log In  

BBS > Superblog
Posts: All | Following    GIFs: All | Postcarts    Off-site: Accounts

Its close to finished

Cart #pumubodg-24 | 2023-01-15 | Code ▽ | Embed ▽ | License: CC4-BY-NC-SA
3

Feel free to give me feedback

Controls

On keyboard

-Arrow keys to move
-n/z/c to shoot laser
-m/x/v to place space mine

Gameplay

-Beat the new boss

Thank you for playing
Have fun

3
0 comments


Cart #confetti-1 | 2022-12-03 | Code ▽ | Embed ▽ | No License
6

Just a little cart I made to play around with some 3d projection.

I also used the idea from this post to avoid storing the confetti in an array.

⬆️ fwd
⬇️ back
⬅️ left
➡️ right
🅾️ down
❎ up

Edit : made some adjustments after understanding the math better and added documentation

6
2 comments


Cart #canarinho-0 | 2022-12-02 | Code ▽ | Embed ▽ | No License
4

4
6 comments


Cart #jaromehepu-0 | 2022-12-01 | Code ▽ | Embed ▽ | License: CC4-BY-NC-SA
1

1
0 comments


Cart #empty-1 | 2022-12-01 | Code ▽ | Embed ▽ | No License
1

@bikibird for speako-8

my head for being empty

also the original creator of the meme

1
0 comments


Cart #yegumagizi-0 | 2022-12-01 | Code ▽ | Embed ▽ | License: CC4-BY-NC-SA
9

Barnsley Fern https://en.wikipedia.org/wiki/Barnsley_fern

Tweetcart version:

Cart #gesabeteyo-0 | 2022-12-01 | Code ▽ | Embed ▽ | License: CC4-BY-NC-SA
9

9
1 comment


last update 15.12.2022

Cart #moth-15 | 2022-12-15 | Code ▽ | Embed ▽ | License: CC4-BY-NC-SA
7

You need defend tape player from "Magics".
When "Magics" touches the tape recorder, lifes are decreasing.
If you run out of lifes you will lose.
When the timer reaches zero you win.

7
8 comments


Cart #knutil_bpack-2 | 2024-12-21 | Code ▽ | Embed ▽ | No License
15

Feature Overview

BPACK() pack the value of the bit specification with bit width.

  • If multiple bit values are specified, pack toward the most significant bit.
  • To start bit packing from the decimal point bit, set [number s] to a negative value.
  • If there are fewer bit width elements for the value to pack, the bit width elements are rotated.
  • This function consumes 38 Token.
v=bpack({8,4},0,0xff,0xb)
?tostr(v,1) -- 0x0bff.0000 (bit-left-shift:0)

v=bpack({8,4},4,0xff,0xb)
?tostr(v,1) -- 0x0bff.0000 (bit-left-shift:4)

This function is included in the KNUTIL library.

release note


v0.2a

  • changed the bit shift direction at the start of packing (negative is toward the decimal point).

v0.2

  • change the bit order to little endian.

v0.1

  • first release
0 comments


This is probably a huge request, but it would be super useful for me.

Nowadays, most of my Pico-8ing takes place on pico-8-edu.com on a school-issued chromebook. Which means it's bad. It randomly decides to sign me out, reload tabs, and/or clear my downloads folder. So I have to backup all my projects to Github daily or I risk losing my project. My friend @Ummmm_ok lost progress on like 3 games he'd been working on when his tabs reloaded and hadn't backed up in a while (he has the same situation as me).

It would be extremely nice (in my opinion) if the education edition worked a bit more like Scratch, where the projects are linked to an account and saved in the cloud. That way, it wouldn't be as much work to back it up all the time.

Perhaps there would just be a button in the top right corner with your username and profile picture. When you click it, it gives you a list of all carts saved on your account. Then you can click one to load it. It would autosave like every 30 seconds or so, or alternatively you'd have to manually save like it is currently.

[ Continue Reading.. ]

6
9 comments


Cart #starjump_pico_cover-2 | 2022-11-30 | Code ▽ | Embed ▽ | No License
9


i did a cover of starjump from Celeste for @ooooggll and thought i should put it here :)

i quite love love love starjump but couldn't do it justice (especially the baseline, anxiety parts) but whatever hope you like it.

9
3 comments


No, it's not a duolingo demake.

Cart #duo-0 | 2022-11-30 | Code ▽ | Embed ▽ | License: CC4-BY-NC-SA
36


It's a simple demake of Duet, a (primarily) mobile game by Kumobius. Made in about 2 days.
Also featuring auto-generated levels! Yay! Let me know your highscore (or when you gave up because you were bored).

36
15 comments


Cart #shapeofmind-2 | 2022-12-14 | Code ▽ | Embed ▽ | No License
329

Arrow keys - Move cursor
(X) - Confirm, pick up pieces, drop pieces
(O) - Cancel
Enter - Menu

​Shape of Mind is a simple puzzle game similar to Solitaire card games. Connect shapes by dragging them on the board. Shapes of the same color won't connect. You can move strips of connected shapes by grabbing the top-most shape of a strip. Drop shapes onto the Dreamer to begin a Halo. Shapes in the Halo cannot be removed. Once a Halo is complete the shapes will disappear. Complete three Halos to clear all the shapes and win the game!

[ Continue Reading.. ]

329
34 comments


how to i export a cart as an image

2 comments


Cart #knutil_bunpack-3 | 2024-12-21 | Code ▽ | Embed ▽ | No License
15

Feature Overview

BUNPACK() slice the value with bit width.

  • by specifying the argument after [number w], a value of up to 32 bits can be sliced.
  • set [number s] to a negative value to start the slicing from the decimal point bit.
  • This function consumes 30 Token.
a,b=bunpack(0xf8,0,4,4) -- Value, First bit-shift, bit-width, ...[bit-width]
?a -- 8  (0x8)
?b -- 15 (0xf)

This function is included in the KNUTIL library.

release note


v0.2

  • change table storage order to little endian.

v0.1

  • first release
2
0 comments


Cart #tuyizubuso-3 | 2022-12-10 | Code ▽ | Embed ▽ | License: CC4-BY-NC-SA
5

Hello friends ! this is the second episode of the Aliens invaders saga !

I hope you can have some fun !

Enjoy !

5
9 comments


stars={}
for s=1,10do
add(stars,{x=128,y=128,spd=rnd(3)})
end
for i in all(stars)do
i.x-=i.spd
pset(i.x,i.y,7)
end

hey! super quick and basic question, feel like ive definitely done this before but i am just not thinking hard enough rn but why isn't this working? no errors are being thrown so i feel like im definitely forgetting something super basic thats making it all break but i am still a beginner and can't seem to figure out what. ty for any help!

2 comments


Cart #moonshmup-0 | 2022-11-29 | Code ▽ | Embed ▽ | License: CC4-BY-NC-SA
1

MOONSHMUP

Inspired by "Moonpong: The Tales Of Epic Lunacy" by Punkcake Deliceux and Remy Devaux.

Small mod of SHMUP by Lazy Devs

Many sprites and models are specially drawn as in the original

Have a fun \^_^/

1
1 comment


Cart #vector_p8-13 | 2025-09-05 | Code ▽ | Embed ▽ | License: CC4-BY-NC-SA
21

vector.p8

a simple and lightweight (in tokens) vector math library for PICO-8.

usage:

  • load #vector_p8 and save as such: vector.p8
  • remove all the demo code; it's in the second tab
  • #include in any cart you want

functions within:

> NOTE:
> vectors are just normal Lua tables with x and y fields, so you can pass any table that contains x and y to any of the functions and they will work regardless.

creation and management

vector(x,y) - the main function. x and y default to 0

v_polar(angle, length) - makes a new vector using polar coordinates
v_rnd() - returns a normalized vector with a random direction

[ Continue Reading.. ]

21
9 comments


Cart #gubegimofi-0 | 2022-11-28 | Code ▽ | Embed ▽ | License: CC4-BY-NC-SA
4

4
6 comments


I'm going to start with my general understanding and label questions [Q#] with the hope someone can fill in the blanks. Consider the discussion of 'cost' in terms of speed/cpu. I'm hoping there's a general concept I'm missing that will cleanup the flurry of questions around [Q2], regardless please bear with me:

General code is written topdown like the below where you define the function at the top and then you can simply call said function below that point to access the block inside. I don't fully understand the cost, in terms of lua itself, associated with defining 'function a()end' (the pico8 wiki has general pico8 cycle costs). My understanding though is the program won't look inside of the function 'until' I call it and so there is simply some generic predefined 'base cost'(cpu cycles) to defining a function and this cost is not affected by the number of parameters or whatever is inside the function....tldr it's always a flat cost each time the compiler/better-word runs down that part of the page and sees you want to define a function. So this usually amounts to the general idea of 'define the function once at the top of the code' and then call it as many times as u need where u need to after:

[ Continue Reading.. ]

4 comments




Top    Load More Posts ->