Boolfuck

Boolfuck is a variation of Brainfuck where cells store booleans instead of integers. Boolfuck is Turing complete.

Language Overview

Boolfuck operates on an array of memory cells, each initially set to false.

Like in a Turing machine, there is a pointer, initially pointing to the first memory cell.

Programs are composed of commands, represented with symbols:

Command	Operation
>	Move pointer right
<	Move pointer left
*	Flip current cell
[	Jump forward past matching ] if current cell is zero
]	Jump back to matching [ if current cell is non-zero

BB_boolf

BB_boolf(n) returns the maximum true cells count a program with n instructions can have when halting.

n	BB_boolf(n) (Score)	Score Champion
1	1	*
2	1	*>
3	2	*>*
4	2	*>*>
5	3	*>*>*
6	3	*>*>*>
7	4	*>*>*>*

[page under construction]