Games Check Connected Points

Eme Fibonacci

Well-Known Member

Licensed User

Longtime User

• Nov 23, 2018

• #1

If I have a 2D matrix (e.g. 9x9)
Columns(1-9) and Rows(1-9)

'111100100
'001000100
'001110100
'111000100
'001110001
'100000101
'111110001
'001011111
'111000000

How to check:
If points (1,1) and (5,5) are connected? (Yes)
If points (7,1) and (7,6) are connected? (No)
If points (1,9) and (9,5) are connected? (Yes)

This algorithm Seems complicated.

Any idea?

 

Gunther

Active Member

Licensed User

Longtime User

• Nov 23, 2018

• #2

well, what you mean by "connected"? What kind of connection? Figures? Patterns? What algo you see in this 3 lines?

What is the meaning of the colors? Why is the single "1" is red in (7,6)?

If this is some kind of maze you may use a maze solving algo with the points of interest as start and end point.
https://www.b4x.com/android/forum/t...-algorithm-w-path-optimization.61998/#content

 

Last edited: Nov 23, 2018

S

sorex

Expert

Licensed User

Longtime User

• Nov 23, 2018

• #3

you need to iterate through all directions to see if there's a valid direction and if there is iterate again by calling the same sub again for the new position.

 

Arthur Ávila

Member

Licensed User

• Nov 23, 2018

• #4

Probably the best way to do this is to use recursivity. I guess you could get some guidance looking for minesweeper or naval battle algorithms.

 

Eme Fibonacci

Well-Known Member

Licensed User

Longtime User

• Nov 26, 2018

• #5

Hello everyone. I'm trying to do this using "Connected Component Labeling" algorithm.