Loader3229 at 12:59, 24 October 2026

2026-10-24T12:59:44Z

← Older revision		Revision as of 12:59, 24 October 2026
Line 32:		Line 32:
	{\| class="wikitable"		{\| class="wikitable"
	!n		!n
	!BB_boolf(n)		!BB_boolf(n) (Score)
	!Champion		!Score Champion
	\|-		\|-
	\|1		\|1

Polygon: /* BB_boolf */ brainf --> boolf in table

2026-05-23T08:08:55Z

BB_boolf: brainf --> boolf in table

← Older revision		Revision as of 08:08, 23 May 2026
Line 32:		Line 32:
	{\| class="wikitable"		{\| class="wikitable"
	!n		!n
	!~~BB_brainf~~(n)		!BB_boolf(n)
	!Champion		!Champion
	\|-		\|-

Azerty: Created the page

2026-05-23T07:42:08Z

Created the page

New page

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:
{| class="wikitable"
|+
!Command
!Operation
|-
|<code>></code>
|Move pointer right
|-
|<code><</code>
|Move pointer left
|-
|<code>*</code>
|Flip current cell
|-
|<code>[</code>
|Jump forward past matching <code>]</code> if current cell is zero
|-
|<code>]</code>
|Jump back to matching <code>[</code> 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.
{| class="wikitable"
!n
!BB_brainf(n)
!Champion
|-
|1
|1
|<code>*</code>
|-
|2
|1
|<code>*></code>
|-
|3
|2
|<code>*>*</code>
|-
|4
|2
|<code>*>*></code>
|-
|5
|3
|<code>*>*>*</code>
|-
|6
|3
|<code>*>*>*></code>
|-
|7
|4
|<code>*>*>*>*</code>
|}

[page under construction]

[[Category:Functions]]

Boolfuck - Revision history

Loader3229 at 12:59, 24 October 2026

Polygon: /* BB_boolf */ brainf --> boolf in table

Azerty: Created the page