BOXit 4.0 was created for the Trijam #74. It's based on BOXit JS, which I've written a few years ago.

I've made this game using PICO-8 on Linux, within 3 hours, as the Trijam rules require. I plan to work further on the game after the jam, because I feel the game is still unfinished (no sound, i.e.).

Rules:

You have to clear the board as far as possible. Take one of the 25 tokens and jump with it onto another token. You can jump either horizontally or vertically, the distance does not matter. But be sure that the target token have either the same color or the same value as the token you are jumping with. The target token will be replaced by the target you were jumping with.

The game ends when no more moves are available. If then only one single token is left, then you have won the game.

Now have fun and good luck.

Controls:

  • Arrow keys - move the marker
  • Z or X - (de)select tokens / confirm
  • X - deselect token regardless position

Change log:

4.1 (2020-06-18)

  • added: sound effects
  • added: mouse support
  • added: deselect option regardless position (X or RMB)
  • added: basic grid editor (see pause menu)
  • fixed: message reset when a new game starts
  • changed: mirrored the two (so it differs better from a three)
  • minor UI changes

4.0 (2020-06-14)

  • initial PICO-8 build for Trijam #74

Legal info:

This game comes with ABSOLUTELY NO WARRANTY. It is free software, and you are welcome to redistribute it under the conditions of the GNU GPL v3.

StatusReleased
PlatformsWindows, macOS, Linux, HTML5
Rating
Rated 5.0 out of 5 stars
(1)
Authorhatnix
GenrePuzzle
Made withPICO-8
TagsPICO-8, Singleplayer

Download

Download
boxit_linux_4.1.zip 653 kB
Download
boxit_raspi_4.1.zip 1 MB
Download
boxit_windows_4.1.zip 1 MB
Download
boxit_osx_4.1.zip 3 MB
Download
boxit_source_4.1.zip 32 kB
Download
boxit_4.0_trijam74.zip 6 MB

Comments

Log in with itch.io to leave a comment.

i´m bearly good in this neat game ^^

(3 edits)

I made a solver for the game in JavaScript; so far I haven't seen an unsolvable grid. https://gist.github.com/bojidar-bg/1142c341be5bdd1a9117fcd6e6f85ae9

The solver uses simple Depth-First-Search, without optimizations apart from passing everything around as immutable strings, instead of using arrays.

It supports two modes for inputting board data: a compact format using all letters of the English alphabet to represent a board and a more human-readable format which uses a letter representing the color followed by a digit.

For output, it can output colored text if running under Node.js with the cli-color package; otherwise, it will use an uncolored output format similar to the human-readable input format.

Update: Board "auheixpjyfcgnrldbtvmwqkso" seems to be unsolved after throwing 5 GB and 6 hours at it, let's see if the process finishes eventually.
Update: Board "auheixpjyfcgnrldbtvmwqkso" was solved very quickly by switching the order in which moves are made from horizontal to vertical.  Whooops!

Awesome! Thank you!