Now a tricky one ;-)

[felixnielsen]

Consider this 3d vector:

const SIZE = 'some_size';
std::vector<std ::vector<std::v ector<char> > >GRID(SIZE,
std::vector<std ::vector<char> >(SIZE,
std::vector<cha r>(SIZE)));

It can be viewed as coords for SIZE^3 different points in a 3d space:
Now, instead of point consider Cubes.
They each have 6 sides:
front - z+
back - z-
top - y+
bottom - y-
rigth - x+
left - x-
(+/- being direction on the axis)

Each of the 6 sides can be turned on/off so you get like a 3d
labyrinth.

And now for the tricky part:
1.
No point/cube can be completely closed, i.e. the sum of the 6 bit
defining it must be < 6 or if you and the bits the result must be 0,
ect.
allso consider only using 3 bits to define each point/cube in the grid.
2.
There must be away from any given point/cube to another.
To help this the cube is infinite/finite, what i mean is best shown
with an example:

The Grid is the size of 16^3
Sudenly you find your self at point 17,17,17 (x,y,z) how ever it is no
problem bacause the point is allso defined as 1,1,1 (x,y,z)
Now only one question remains...
How to do it the easy way?
Hope to get some mindblowing ideas... ;-)

[Kai-Uwe Bux]

fe**********@ho tmail.com wrote:

Consider this 3d vector:

const SIZE = 'some_size';
std::vector<std ::vector<std::v ector<char> > >GRID(SIZE,
std::vector<std ::vector<char> >(SIZE,
std::vector<cha r>(SIZE)));

It can be viewed as coords for SIZE^3 different points in a 3d space:
Now, instead of point consider Cubes.
They each have 6 sides:
front - z+
back - z-
top - y+
bottom - y-
rigth - x+
left - x-
(+/- being direction on the axis)

Each of the 6 sides can be turned on/off so you get like a 3d
labyrinth.

And now for the tricky part:
1.
No point/cube can be completely closed, i.e. the sum of the 6 bit
defining it must be < 6 or if you and the bits the result must be 0,
ect.
allso consider only using 3 bits to define each point/cube in the grid.
2.
There must be away from any given point/cube to another.
To help this the cube is infinite/finite, what i mean is best shown
with an example:

The Grid is the size of 16^3
Sudenly you find your self at point 17,17,17 (x,y,z) how ever it is no
problem bacause the point is allso defined as 1,1,1 (x,y,z)
Now only one question remains...
How to do it the easy way?
If only that question was well-posed. What is *it*?

Options:

a) define a data structure to model the situation.
b) test whether a given set of data satisfies conditions (1) and (2).
c) write a graphics interface to display the model on screen.
d) write a simulation of mice running through that labyrinth.
e) ...

Please, be more specific.

Hope to get some mindblowing ideas... ;-)

Good luck.
Best

Kai-Uwe Bux

[felixnielsen]

I thought i did enough explaining, its an idea i got some time ago, but
i dont really need help with it atm, just though it would be an
interesting subjet to discuss.
Ill try to explain again.

a) Define a data structure to simulate a 3d labyrinth, rubrikscube
like, i.e. a cube containing cubes.
b) test whether condition 1 and 2 is true, if not solve the problem.
Condition 1.
cube can be completely closed
Condition 2.
There must be away from any given point/cube to another.
To help this the cube is infinite/finite, what i means is best shown
with an example:

The Grid is the size of 16^3
Sudenly you find your self at point 17,17,17 (x,y,z) how ever it is no

problem bacause the point is allso defined as 1,1,1 (x,y,z)

c) A 3d graphics interface to move around in the labyrinth would be
nice, it is however not something i expect from anyone but my self.
(sometime in the future)
d) Come with ideas/oppinions.

I dont thing i can write it any simpler than this, sry ;-)

[felixnielsen]

*************** **
Condition 1.
cube can't be completely closed
*************** **

[Ian Collins]

fe**********@ho tmail.com wrote:

*************** **
Condition 1.
cube can't be completely closed
*************** **

What cube? Please quote.

--
Ian Collins.

[felixnielsen]

ofcourse it can be misinterpeted, sry.
the 'GRID' is made up by 'CUBES' like coordinates in 3 dimensions.

heres a little thing i pu together that might amuse some:

#include <iostream>
#include <vector>

const int SIZE = 256;
std::vector<std ::vector<std::v ector<char> > >GRID(SIZE,
std::vector<std ::vector<char> >(SIZE,
std::vector<cha r>(SIZE)));
std::vector<boo l>B(8);

bool rand_bit() {
return rand() > (RAND_MAX / 2);
}

void write_bits(int x,int y,int z) {
GRID[x][y][z] |= B[0]?1:0;
GRID[x][y][z] |= B[1]?2:0;
GRID[x][y][z] |= B[2]?4:0;
GRID[x][y][z] |= B[3]?8:0;
GRID[x][y][z] |= B[4]?16:0;
GRID[x][y][z] |= B[5]?32:0;
GRID[x][y][z] |= B[6]?64:0;
GRID[x][y][z] |= B[7]?128:0;
}

void read_bits(int x,int y,int z) {
B[0] = GRID[x][y][z]&1;
B[1] = GRID[x][y][z]&2;
B[2] = GRID[x][y][z]&4;
B[3] = GRID[x][y][z]&8;
B[4] = GRID[x][y][z]&16;
B[5] = GRID[x][y][z]&32;
B[6] = GRID[x][y][z]&64;
B[7] = GRID[x][y][z]&128;
}

void new_grid() {
int x;
int y;
int z;
for (z = 0; z < SIZE; z++) {
for (y = 0; y < SIZE; y++) {
for (x = 0; x < SIZE; x++) {
B[0] = rand_bit();
B[1] = rand_bit();
B[2] = rand_bit();
write_bits(x,y, z);
if (x == SIZE - 1) {
GRID[x-(SIZE-1)][y][z] |= B[0]?8:0;
}
else {
GRID[x+1][y][z] |= B[0]?8:0;
}
if (y == SIZE - 1) {
GRID[x][y-(SIZE-1)][z] |= B[1]?16:0;
}
else {
GRID[x][y+1][z] |= B[1]?16:0;
}
if (z == SIZE - 1) {
GRID[x][y][z-(SIZE-1)] |= B[2]?32:0;
}
else {
GRID[x][y][z+1] |= B[2]?32:0;
}
}
}
}
}

void search_illegal( ) {
int x;
int y;
int z;
for (z = 0; z < SIZE; z++) {
for (y = 0; y < SIZE; y++) {
for (x = 0; x < SIZE; x++) {
read_bits(x,y,z );
if (B[0]&B[1]&B[2]&B[3]&B[4]&B[5] == 1) {
std::cout << x << "," << y << "," << z << " IS
ILLEGAL!";
std::cin.get();
}
}
}
}
}

int main() {
std::cout << "Defining new grid...";
new_grid();
std::cout << "done";
std::cin.get();
search_illegal( );
}

This way works except that u get alot of "illegal" cubes that are
closed.
it doesnt look at the "get to one point from another without any
trouble" issue.

[felixnielsen]

by the way, this allso need a non pseudo random bit genarator,
otherwise ull just get the same setup every time you restart the
program...

[Gernot Frisch]

> by the way, this allso need a non pseudo random bit genarator,

otherwise ull just get the same setup every time you restart the
program...

rand, srand, time

[Kai-Uwe Bux]

fe**********@ho tmail.com wrote:

I thought i did enough explaining, its an idea i got some time ago, but
i dont really need help with it atm, just though it would be an
interesting subjet to discuss.
Ill try to explain again.

a) Define a data structure to simulate a 3d labyrinth, rubrikscube
like, i.e. a cube containing cubes.
b) test whether condition 1 and 2 is true, if not solve the problem.
You keep talking riddles: solve *which* problem. So far you have not stated
any problem.
Condition 1.
cube can be completely closed
Condition 2.
There must be away from any given point/cube to another.
To help this the cube is infinite/finite, what i means is best shown
with an example:

The Grid is the size of 16^3
Sudenly you find your self at point 17,17,17 (x,y,z) how ever it is no

problem bacause the point is allso defined as 1,1,1 (x,y,z)

c) A 3d graphics interface to move around in the labyrinth would be
nice, it is however not something i expect from anyone but my self.
(sometime in the future)
d) Come with ideas/oppinions.

I dont thing i can write it any simpler than this, sry ;-)

It's not a matter of your description not being simple; it is a matter of
your description being neither precise nor complete. You seem to be
obsessed with the wrap-around feature of your model. I guess, that is
understood by now. What is still missing is what you want to do with this
space.

So there is this building with 16*16*16 rooms, each the shape of a cube.
These room have 6 walls each and some walls have doors. Also this building
has a star trek like transport unit so that when you pass through a door
that would take you outside the building, you are automagically teleported
so that you reenter the building from the opposite side. There are so many
doors that you can get from any room to any other room (possibly using the
teleporting feature). I got that much. Now what?
Best

Kai-Uwe Bux

[felixnielsen]

Now nothing, thats all finish, fin, fini, i just need a way to build
this system and a way to hold the information, i have thought alot
about it and think its a pretty hard task. ofcourse i have other ideas
too, fx. what to use it for, but i dont think thats important right
know, just think about it as a big 3d labyrint.