Is there another way to check dim stored values?

Author

Message

HowDo

23

Years of Service

User Offline

Joined: 28th Nov 2002

Location: United Kingdom

Posted: 21st Jul 2010 15:50

Link

trying to find another way of checking a winning line when I have 9 squares to check.

one win line would be 123 across or 456 or 147.

now the stored value is from 1 to 6, at the moment I am doing this

+ Code Snippet

if store(1,1)=1 and store(2,1)=1 and store(3,1)=1
win=1
endif

now that's a lot of typing and when I have 9 winning ways times 6 makes for lot of code.

what the square lands on is placed in stored like so, first number the square the next number check options then the value from 1 to 6.

so any ideas?

Dark Physics makes any hot drink go cold.

Back to top

Profile PM

Hawkblood

16

Years of Service

User Offline

Joined: 5th Dec 2009

Location:

Posted: 21st Jul 2010 15:55

Link

I'm still not sure what you are wanting, but if you have a large array that needs to be checked by a value:

+ Code Snippet

win as boolean
win=1
for i=0 to 1000
  if store(i,1)<>1 then win=0
next i
if win=1 then *** win ***

The fastest code is the code never written.

Back to top

Profile PM Email Website

HowDo

23

Years of Service

User Offline

Joined: 28th Nov 2002

Location: United Kingdom

Posted: 21st Jul 2010 16:04 Edited at: 21st Jul 2010 16:12

Link

Hawkblood thank's, one way but the stored array is only nine in size.

123
456
789

that's how the squares are laid out on the screen.
win lines are:-
123 or 456 or 789 or 145 or 258 or 789
and
1245 or 2356 or 4578 or 5689
and
12347 or 12358 or 12369

and so on..
square 1 could have 1-6 stored in it.
sq1=6 sq2=4 sq3=5 would equal no win.

does this help explain.

Dark Physics makes any hot drink go cold.

Back to top

Profile PM

Hawkblood

16

Years of Service

User Offline

Joined: 5th Dec 2009

Location:

Posted: 21st Jul 2010 16:12

Link

Quote: "does this help."

No. I don't understand what you are trying to do. I am not seeing a pattern in your system....

The fastest code is the code never written.

Back to top

Profile PM Email Website

sladeiw

17

Years of Service

User Offline

Joined: 16th May 2009

Location: UK

Posted: 21st Jul 2010 16:13

Link

If you are checking a large array then for any point in the array store(x,y) there are 4 winning lines assuming (x,y) is the centre point of those lines: Horizontal, vertical and 2 diagnonals. Something like:

+ Code Snippet

if store(x,y)=1                                        `centre
  win=0
  if store(x-1,y)=1 and store(x+1,y)=1 then win=1      `horiz
  if store(x,y-1)=1 and store(x,y+1)=1 then win=1      `vert
  if store(x-1,y-1)=1 and store(x+1,y+1)=1 then win=1  `diag 1
  if store(x+1,y-1)=1 and store(x-1,y+1)=1 then win=1  `diag 2

  if win=1
    print "win!"
  endif
endif

You also need to check you don't go out of bounds ie. checking (0,0) then would try and access (-1,-1)

Back to top

Profile PM

HowDo

23

Years of Service

User Offline

Joined: 28th Nov 2002

Location: United Kingdom

Posted: 21st Jul 2010 16:24 Edited at: 21st Jul 2010 16:42

Link

winning line are

three in a row or column.-|
four in a corner, top left, top right, bottom left, bottom right.
top row any column down.
middle row any column down.
bottom row any column down.
first column any row across.
second column any row across.
third column any row across.
rotated U meaning first column, bottom row, last column, then rotate.
top and middle row.
middle and bottom row.
first and second column.
second and third column.
X or + shape win.
all nine squares.

as you can see a few to check.

edit
think I have 29 possible way to get a win times 6.

+ Code Snippet

111 111 100 000 111
000 100 100 011 111
000 100 111 011 000

000 111 010 111 000
111 010 010 101 111
000 010 111 101 111

000 111 001 111 110
000 001 001 001 110
111 001 111 111 110

100 100 110 101 011
100 111 110 101 011
100 100 000 111 011

010 010 011 111 111
010 111 011 100 111
010 010 000 111 111

001 001 000 101
001 111 110 010
001 001 110 101

Dark Physics makes any hot drink go cold.

Back to top

Profile PM

Hawkblood

16

Years of Service

User Offline

Joined: 5th Dec 2009

Location:

Posted: 21st Jul 2010 18:08

Link

Make an array of Wins(29,3,3) as boolean.
Put each of the winning combinations into that array. Do a loop of 29 to see if the player combination matches a winning combo.

The fastest code is the code never written.

Back to top

Profile PM Email Website

HowDo

23

Years of Service

User Offline

Joined: 28th Nov 2002

Location: United Kingdom

Posted: 21st Jul 2010 19:00

Link

ok tried this

+ Code Snippet

dim wins(34) as boolean

wins(1)=%111000000
wins(2)=%000111000
wins(3)=%000000111
wins(4)=%100100100
wins(5)=%010010010
wins(6)=%001001001
wins(7)=%110110000
wins(8)=%011011000
wins(9)=%000110110
wins(10)=%000011011
wins(11)=%111100100
wins(12)=%111010010
wins(13)=%111001001
wins(14)=%100111100
wins(15)=%010111010
wins(16)=%001111001
wins(17)=%100100111
wins(18)=%010010111
wins(19)=%001001111
wins(20)=%101010101
wins(21)=%111111000
wins(22)=%000111111
wins(23)=%110110110
wins(24)=%011011011
wins(25)=%110110111
wins(26)=%111101101
wins(27)=%111001111
wins(28)=%101101111
wins(29)=%111100111
wins(30)=%111111101
wins(31)=%111110111
wins(32)=%111011111
wins(33)=%101111111
wins(34)=%111111111

for i = 1 to 34
print bin$(wins(i))
next i
wait key

only thing is it does not re display what I put in.

Dark Physics makes any hot drink go cold.

Back to top

Profile PM

baxslash

Valued Member

Bronze Codemaster

19

Years of Service

User Offline

Joined: 26th Dec 2006

Location: Duffield

Posted: 21st Jul 2010 19:10 Edited at: 21st Jul 2010 19:20

Link

OK so as a slight change to your code:

+ Code Snippet

dim wins$(34)

wins$(1)="111000000"
wins$(2)="000111000"
wins$(3)="000000111"
wins$(4)="100100100"
wins$(5)="010010010"
wins$(6)="001001001"
wins$(7)="110110000"
wins$(8)="011011000"
wins$(9)="000110110"
wins$(10)="000011011"
wins$(11)="111100100"
wins$(12)="111010010"
wins$(13)="111001001"
wins$(14)="100111100"
wins$(15)="010111010"
wins$(16)="001111001"
wins$(17)="100100111"
wins$(18)="010010111"
wins$(19)="001001111"
wins$(20)="101010101"
wins$(21)="111111000"
wins$(22)="000111111"
wins$(23)="110110110"
wins$(24)="011011011"
wins$(25)="110110111"
wins$(26)="111101101"
wins$(27)="111001111"
wins$(28)="101101111"
wins$(29)="111100111"
wins$(30)="111111101"
wins$(31)="111110111"
wins$(32)="111011111"
wins$(33)="101111111"
wins$(34)="111111111"

Then check using:

+ Code Snippet

for x=1 to 3
   for y=1 to 3
      s$=s$+str$(store(x,y))
   next
next
win=0
for w=1 to 34
   if s$=wins$(w) then win=1
next

Back to top

Profile PM Email

HowDo

23

Years of Service

User Offline

Joined: 28th Nov 2002

Location: United Kingdom

Posted: 21st Jul 2010 19:16

Link

that what I sort of have, was hoping to find a simpler way that did not involve putting in 34 wins if statements with 9 checks in each.

seeing the binary system looks broke will have to try "0010101" version to keep the ninth bit.

Dark Physics makes any hot drink go cold.

Back to top

Profile PM

baxslash

Valued Member

Bronze Codemaster

19

Years of Service

User Offline

Joined: 26th Dec 2006

Location: Duffield

Posted: 21st Jul 2010 19:21

Link

Well you do have quite a complicated system for winning...

Back to top

Profile PM Email

baxslash

Valued Member

Bronze Codemaster

19

Years of Service

User Offline

Joined: 26th Dec 2006

Location: Duffield

Posted: 21st Jul 2010 19:41 Edited at: 21st Jul 2010 19:45

Link

You could reduce the number of checks as some of these aren't necessary as they contain duplicates... for example why check "111111111" when you know you win with "111000000"?

You can reduce the number of checks to 13 if it's OK to remove those:
EDIT: Ooops, actually you can reduce it to 11!

+ Code Snippet

dim wins$(34)

wins$(1)="111000000"
wins$(2)="000111000"
wins$(3)="000000111"
wins$(4)="100100100"
wins$(5)="010010010"
wins$(6)="001001001"
wins$(7)="110110000"
wins$(8)="011011000"
wins$(9)="000110110"
wins$(10)="000011011"
wins$(11)="101010101"

Then check using:

+ Code Snippet

s$=""
for x=1 to 3
   for y=1 to 3
      s$=s$+str$(store(x,y))
   next
next
win=0
for w=1 to 11
   if s$=wins$(w) then win=1
next

Back to top

Profile PM Email

HowDo

23

Years of Service

User Offline

Joined: 28th Nov 2002

Location: United Kingdom

Posted: 21st Jul 2010 19:54

Link

cheers baxslash, I expect your dead right on how many checks that are need, but until I see it [in other words all the possible wins in the 11] will be trying the hard way.

came up with this that makes a winning line for each value of 1 to 6

dim wins(34) as string
dim wc(6) as string
wins(1)="111000000"
wins(2)="000111000"
wins(3)="000000111"
wins(4)="100100100"
wins(5)="010010010"
wins(6)="001001001"
wins(7)="110110000"
wins(8)="011011000"
wins(9)="000110110"
wins(10)="000011011"
wins(11)="111100100"
wins(12)="111010010"
wins(13)="111001001"
wins(14)="100111100"
wins(15)="010111010"
wins(16)="001111001"
wins(17)="100100111"
wins(18)="010010111"
wins(19)="001001111"
wins(20)="101010101"
wins(21)="111111000"
wins(22)="000111111"
wins(23)="110110110"
wins(24)="011011011"
wins(25)="110110111"
wins(26)="111101101"
wins(27)="111001111"
wins(28)="101101111"
wins(29)="111100111"
wins(30)="111111101"
wins(31)="111110111"
wins(32)="111011111"
wins(33)="101111111"
wins(34)="111111111"
t$="234111634"
rem display all 34 wins
for i = 34 to 1 step -1
	print wins(i)
next i
rem set up check and make win table
for d= 1 to 6
	for p= 1 to 9 
		if mid$(t$,p)=str$(d) then wc(d)=wc(d)+"1" else wc(d)=wc(d)+"0"
	next p
next d
print "=========================="
rem find winning line
for l= 1 to 6
	for cw = 34 to 1 step -1
		if wc(l)=wins(cw)
			print wc(l),"   "; cw
		endif
	next cw
next l
wait key

+ Code Snippet

dim wins(34) as string
dim wc(6) as string
wins(1)="111000000"
wins(2)="000111000"
wins(3)="000000111"
wins(4)="100100100"
wins(5)="010010010"
wins(6)="001001001"
wins(7)="110110000"
wins(8)="011011000"
wins(9)="000110110"
wins(10)="000011011"
wins(11)="111100100"
wins(12)="111010010"
wins(13)="111001001"
wins(14)="100111100"
wins(15)="010111010"
wins(16)="001111001"
wins(17)="100100111"
wins(18)="010010111"
wins(19)="001001111"
wins(20)="101010101"
wins(21)="111111000"
wins(22)="000111111"
wins(23)="110110110"
wins(24)="011011011"
wins(25)="110110111"
wins(26)="111101101"
wins(27)="111001111"
wins(28)="101101111"
wins(29)="111100111"
wins(30)="111111101"
wins(31)="111110111"
wins(32)="111011111"
wins(33)="101111111"
wins(34)="111111111"
t$="234111634"
rem display all 34 wins
for i = 34 to 1 step -1
	print wins(i)
next i
rem set up check and make win table
for d= 1 to 6
	for p= 1 to 9 
		if mid$(t$,p)=str$(d) then wc(d)=wc(d)+"1" else wc(d)=wc(d)+"0"
	next p
next d
print "=========================="
rem find winning line
for l= 1 to 6
	for cw = 34 to 1 step -1
		if wc(l)=wins(cw)
			print wc(l),"   "; cw
		endif
	next cw
next l
wait key

now to make a random winning line maker bit for the above code.

Dark Physics makes any hot drink go cold.

Back to top

Profile PM

HowDo

23

Years of Service

User Offline

Joined: 28th Nov 2002

Location: United Kingdom

Posted: 21st Jul 2010 20:16

Link

right this seem to work, if anyone would like it explianed I'll try.

rem make dim as string to save putting a $ sign on each
dim wins(34) as string
dim wc(6) as string
rem load in the winning lines
wins(1)="111000000"
wins(2)="000111000"
wins(3)="000000111"
wins(4)="100100100"
wins(5)="010010010"
wins(6)="001001001"
wins(7)="110110000"
wins(8)="011011000"
wins(9)="000110110"
wins(10)="000011011"
wins(11)="111100100"
wins(12)="111010010"
wins(13)="111001001"
wins(14)="100111100"
wins(15)="010111010"
wins(16)="001111001"
wins(17)="100100111"
wins(18)="010010111"
wins(19)="001001111"
wins(20)="101010101"
wins(21)="111111000"
wins(22)="000111111"
wins(23)="110110110"
wins(24)="011011011"
wins(25)="110110111"
wins(26)="111101101"
wins(27)="111001111"
wins(28)="101101111"
wins(29)="111100111"
wins(30)="111111101"
wins(31)="111110111"
wins(32)="111011111"
wins(33)="101111111"
wins(34)="111111111"
rem set up a loop
while escapekey()<>1
rem clear last values
for o=1 to 6
wc(o)=""
next o
t$=""
rem make a value
for r=1 to 9
	t$=t$+str$(rnd(5)+1)
next r
rem display all 34 wins
for i = 34 to 1 step -1
	print wins(i)
next i
rem set up check and make win table
for d= 1 to 6
	for p= 1 to 9 
		if mid$(t$,p)=str$(d) then wc(d)=wc(d)+"1" else wc(d)=wc(d)+"0"
	next p
next d
print "=========================="
rem print what the six possable lines look like
for j= 1 to 6
print wc(j)
next j
rem find winning line
for l= 1 to 6
	for cw = 34 to 1 step -1
		if wc(l)=wins(cw)
		rem print wins lins and were in table cw
			print wc(l),"   "; cw
		endif
	next cw
next l
rem number of try before a wins
inc try
print t$
print try
wait key
endwhile
end

+ Code Snippet

rem make dim as string to save putting a $ sign on each
dim wins(34) as string
dim wc(6) as string
rem load in the winning lines
wins(1)="111000000"
wins(2)="000111000"
wins(3)="000000111"
wins(4)="100100100"
wins(5)="010010010"
wins(6)="001001001"
wins(7)="110110000"
wins(8)="011011000"
wins(9)="000110110"
wins(10)="000011011"
wins(11)="111100100"
wins(12)="111010010"
wins(13)="111001001"
wins(14)="100111100"
wins(15)="010111010"
wins(16)="001111001"
wins(17)="100100111"
wins(18)="010010111"
wins(19)="001001111"
wins(20)="101010101"
wins(21)="111111000"
wins(22)="000111111"
wins(23)="110110110"
wins(24)="011011011"
wins(25)="110110111"
wins(26)="111101101"
wins(27)="111001111"
wins(28)="101101111"
wins(29)="111100111"
wins(30)="111111101"
wins(31)="111110111"
wins(32)="111011111"
wins(33)="101111111"
wins(34)="111111111"
rem set up a loop
while escapekey()<>1
rem clear last values
for o=1 to 6
wc(o)=""
next o
t$=""
rem make a value
for r=1 to 9
	t$=t$+str$(rnd(5)+1)
next r
rem display all 34 wins
for i = 34 to 1 step -1
	print wins(i)
next i
rem set up check and make win table
for d= 1 to 6
	for p= 1 to 9 
		if mid$(t$,p)=str$(d) then wc(d)=wc(d)+"1" else wc(d)=wc(d)+"0"
	next p
next d
print "=========================="
rem print what the six possable lines look like
for j= 1 to 6
print wc(j)
next j
rem find winning line
for l= 1 to 6
	for cw = 34 to 1 step -1
		if wc(l)=wins(cw)
		rem print wins lins and were in table cw
			print wc(l),"   "; cw
		endif
	next cw
next l
rem number of try before a wins
inc try
print t$
print try
wait key
endwhile
end

Dark Physics makes any hot drink go cold.

Back to top

Profile PM

Sasuke

20

Years of Service

User Offline

Joined: 2nd Dec 2005

Location: Milton Keynes UK

Posted: 22nd Jul 2010 03:51

Link

You could use a 1D array for the score instead of a 2D one and just search the arrays index based off a win string, so for example:

+ Code Snippet

dim _bScore(9) as boolean

_bScore(4) = 1
_bScore(5) = 1
_bScore(6) = 1

print "Check: " ; winCheck()

wait key
end

function winCheck()
    local sVal as string
    restore winData
    for winDataIndex = 1 to 3
        read sVal
        check = 1
        for pos = 1 to len(sVal)
            index = val( mid$( sVal, pos ) )
            if _bScore( index ) <> 1
                check = 0
                exit
            endif
        next
        if check then exitfunction 1
    next
endfunction 0

winData:
data "123"
data "456"
data "789"
//etc

A dream is a fantasy, if you achieve that fantasy it was never a dream to begin with.

Back to top

Profile PM Email

Sorry your browser is not supported!

DarkBASIC Professional Discussion / Is there another way to check dim stored values?