Board Game -- Warcraft Party? haha.

[TheSonOfCulture]

Anyways, I'm trying to create a sort of Warcraft Party Board Game (Like Mario Party!) only I have no idea how to go about setting up the movement. Any ideas on how to even approach this? Players must be able to move forwards, but not back, and must move the amount of spaces they rolled.

In addition, another problem is that there will be multiple paths in some points, meaning that I can't simply 'warp' the player to the location x spaces ahead (which would be much simpler), because they can choose to go different ways!

Oh, man. In over my head! I know I can do it though, I'm just trying to figure out how I should even approach it. Are there any maps you know of which are set up like a board game that I could look at?

 

[low-life]

I don't see the problem. Be more specific.

 

[TheSonOfCulture]

I don't see the problem. Be more specific.

I have no idea how to even approach this really, hmm, I guess I'll try some more stuff out and edit this post with an update.

 

[Kimbo]

i suggest going to wc3c and asking this... but dont...post anything stupid or hard to understand or they will attack you, but by god they are alot smarter.

 

[low-life]

approach what? creating monopoly-like board game? create N regions, put them into single array, and move your unit to center of n-th region whenever he's supposed to move.

 

[TheSonOfCulture]

approach what? creating monopoly-like board game? create N regions, put them into single array, and move your unit to center of n-th region whenever he's supposed to move.

No, a game like Mario Party. There will be forks in the path, and also I don't want the player to be able to move their 'piece' freely around wherever they please. Also, I can't have them moving backwards either.

 

[low-life]

Now we're talking.
You should create an array of nodes. Probably something like this:

node0 connected to node1
node1 connected to node2 and node3
node2 connected to node4, node5, node6
node3 connected to node7
(and so on)

Each node wil have its region on map, and list of nodes it's connected to; they will togeter make your whole path.

NodeRegion[] <- array of regions
NodeConnection[] <- array of integers

Assuming node can't be connected to more than 4 other notes (in our case node2 is connected to three nodes):

NodeRegion[0]={Region of node 0, place on map where players start}
NodeConnection[0]=1 (node0 connected to node1)
NodeConnection[1]=-1
NodeConnection[2]=-1 (and to nothing else)
NodeConnection[3]=-1

NodeRegion[1]={Region of node 1, some place on map}
NodeConnection[4]=2 (node1 connected to node2)
NodeConnection[5]=3 (and node3)
NodeConnection[6]=-1 (and to nothing else)
NodeConnection[7]=-1

NodeRegion[2]={Region of node 2, some place on map}
NodeConnection[8]=4 (node2 connected to node4)
NodeConnection[9]=5 (and node5)
NodeConnection[10]=6 (and node6)
NodeConnection[11]=-1

NodeRegion[3]={Region of node 3, some place on map}
NodeConnection[12]=7 (node3 connected to node7)
NodeConnection[13]=-1
NodeConnection[14]=-1
NodeConnection[15]=-1

--- and keep going:

NodeRegion[n]={Region of node n, some place on map}
NodeConnection[4*n+0]=
NodeConnection[4*n+1]=
NodeConnection[4*n+2]=
NodeConnection[4*n+3]=

When it's time to move, do following:
Roll a dice, get a number.
If there is only one connection in current node, move unit to connected node
Else ask player where to move, and move unit accordingly
Reduce number by one, and repeat until number is zero.