Turing Submission~OMOK

[nogardreyals]

This is a Turing Submission made by me for my CompSci ISU for grade 10. Of course I didn't not include comments or a flowchart as expected but I would just like to see the reactions. Well can you tell me if it is good or not?. If you find any glitches or room for improvement please tell me.

[Zampano]

I love the self promoting credit screen. *smile smiley*
Pretty good, though I'd really like to know why you needed this game to be 'funded'. *wink smiley*

[Carey]

There is a waaaay more effective way of checking for a win. Look here

[nogardreyals]

If I use your way than I would be getting help from a Turing Expert
And that would be plagerizing resulting in a zero and i wouldn't want that.
And I'd rather use my own way that I thought of after days of thinking.
Thx anyways

Can anyone else give some feedback?

[fishtastic]

OMOK = connect five !!
very game. code looks clean too.

for the line checking part.
there are many ways, and since you only have a small board you dont really need efficiency.
I will just write it as short as I can, as long as it works.

BTW, Can you make an AI? I know its hard
but I dont wanna play again myself.

[Zampano]

Carey @ Thu Jan 17, 2008 12:47 pm wrote:

There is a waaaay more effective way of checking for a win. Look here :)

Hehe; I'm not sure, Carey. In my Connect Four Game, I was able to make collison detection is a grand total of 14 lines. It was a recursive function.

[Carey]

@ nogardreyals: I wasn't saying to copy the code, just use it to make your own method

@ Zampano: Yes I realize that recursion could shorten the length and make it more efficient, but I didn't even know what recursion was when I made this.

[Sean]

With the get selection, you have it located under the selection word, how about adjusting it to 22, 40 to get it right after the colon.