<s>
In	O
mathematics	O
,	O
the	O
mandelbox	B-Algorithm
is	O
a	O
fractal	B-Application
with	O
a	O
boxlike	O
shape	O
found	O
by	O
Tom	O
Lowe	O
in	O
2010	O
.	O
</s>
<s>
It	O
is	O
defined	O
in	O
a	O
similar	O
way	O
to	O
the	O
famous	O
Mandelbrot	B-Algorithm
set	I-Algorithm
as	O
the	O
values	O
of	O
a	O
parameter	O
such	O
that	O
the	O
origin	O
does	O
not	O
escape	O
to	O
infinity	O
under	O
iteration	O
of	O
certain	O
geometrical	O
transformations	O
.	O
</s>
<s>
The	O
mandelbox	B-Algorithm
is	O
defined	O
as	O
a	O
map	O
of	O
continuous	O
Julia	B-Language
sets	I-Language
,	O
but	O
,	O
unlike	O
the	B-Algorithm
Mandelbrot	I-Algorithm
set	I-Algorithm
,	O
can	O
be	O
defined	O
in	O
any	O
number	O
of	O
dimensions	O
.	O
</s>
<s>
The	O
simple	O
definition	O
of	O
the	O
mandelbox	B-Algorithm
is	O
this	O
:	O
repeatedly	O
transform	O
a	O
vector	O
z	O
,	O
according	O
to	O
the	O
following	O
rules	O
:	O
</s>
<s>
A	O
notable	O
property	O
of	O
the	O
mandelbox	B-Algorithm
,	O
particularly	O
for	O
scale	O
−	O
1.5	O
,	O
is	O
that	O
it	O
contains	O
approximations	O
of	O
many	O
well	O
known	O
fractals	B-Application
within	O
it	O
.	O
</s>
<s>
For	O
the	O
mandelbox	B-Algorithm
contains	O
a	O
solid	O
core	O
.	O
</s>
<s>
Consequently	O
,	O
its	O
fractal	B-Application
dimension	O
is	O
3	O
,	O
or	O
n	O
when	O
generalised	O
to	O
n	O
dimensions	O
.	O
</s>
<s>
For	O
the	O
mandelbox	B-Algorithm
sides	O
have	O
length	O
4	O
and	O
for	O
they	O
have	O
length	O
.	O
</s>
