|
In addition
In addition - probably because I'm so open minded, I personally do believe it's possible for a computer to be programed to fully understand natural languages.
My personal opinion, I'm not saying this after reading from a text book - most books will probably share a similar negative attitude as I have already expressed.
|
Trent,
A contest/challenge is typically associated with some sort of incentive.
Be it a prize, an award, or maybe just a gentleman's wager.
So assuming someone has spent the last couple days writing an Unbeatable Tic-Tac-Toe game in PicBasic Pro, and they decided to submit it.
What's the pay-off?
<br>
DT
|
I think a project competition with prizes would go down great. You already have a voting system in tact. But unfortunately, it's not such an obvious thing to be able to do. (This is one of the reasons why few threads actually have votes) The voting needs to be more clearly visible somewhere. It needs to be seen at a glance.
The other problem is that you're allowing people on the site without having to create an account. If you made it mandatory to sign up for membership after visiting the site more than a couple of times - this would possibly improve interaction. You could also enforce voting to some extent too.
|
Sorry if that came out wrong!
What I meant to say was....
I've just spent the last two days writing an unbeatable Tic-Tac-Toe program for PicBasic Pro.
There seems to have been a challenge to do so, so I accepted it without even knowing Why. (other than it seemed interesting)
As you've already pointed out, it's not as easy as it first seems.
I'm currently trying to finish up the third version.
The first two did more toward teaching me how to play Tic-Tac-Toe than they did actually playing it.
One thing I found interesting with those two versions was, when you let the PIC play against itself, it was always a draw. But when you played it yourself, it was quite easy to beat. Even the first version was like that.
So I have to question the reasoning that letting a program play against itself somehow proves that it's unbeatable. It may just be playing at the same level.
With that in mind, I think that the only way to determine who's is the closest to Un-Beatable, we need to come up with a way to have the programs play each other.
But then there's that what's in it for me thing.
<br>
DT
|
Right on...
Did you take a look at the Visual Basic source? If the protocol is correct - AI is solid if it always draws while playing against itself. But it can't always follow hard coded rules of logic. This I suspect is where your error is.
Protocol should be as follows:
AI checks for winning move.
AI checks to block opponents win.
AI makes move at random. (without this you can't verify AI's strength if set to play against itself)
<br/>
Last edited by T.Jackson; - 5th May 2007 at 04:54.
|
No. It was a total process of "Trial&Error".Originally Posted by T.Jackson
I did a search on Google, but came up with a bunch of C++
Might as well have shown me a map to antarctica. Would have helped just as much.
So the idea is a completely original re-creation of what I'm sure 1,000 other people have already done.
Here's where the challenge comes in. . . . You think I have Errors!... This I suspect is where your error is.
If I recall, that was version 1.Protocol should be as follows:
AI checks for winning move.
AI checks to block opponents win.
AI makes move at random. (without this you can't verify AI's strength if set to play against itself)
<br>
DT
|
VB Source Portion A
I can't paste the entire source - (500,000 chrs in length) - So I'll instead post the 3 main procedures of the protocol.
Code:Public Sub Perform_Calculated_Move(Compare As Integer) '----------------------------------------------------------------------------- 'Procedure is called for when CPU is attempting to block your win or win the 'actual game itself. For calculated blocking Compare is set to 0. When the CPU 'decides that there are no wining moves, it will then attempt to block your win. 'Compare is then set to 1. Looking at all angles, rows, cols & diagonal streaks. '----------------------------------------------------------------------------- '// Dim i As Long Dim j As Long '// 'Check diagonal \, do we have 2? '// If Grid_Set(0, 0) = Players_CHR(Compare) And Grid_Set(2, 2) = Players_CHR(Compare) And Grid_Set(1, 1) = 0 Then Grid_Set(1, 1) = Players_CHR(Players_Turn) CPU_Moved = True Exit Sub ElseIf Grid_Set(0, 0) = Players_CHR(Compare) And Grid_Set(1, 1) = Players_CHR(Compare) And Grid_Set(2, 2) = 0 Then Grid_Set(2, 2) = Players_CHR(Players_Turn) CPU_Moved = True Exit Sub '// ElseIf Grid_Set(1, 1) = Players_CHR(Compare) And Grid_Set(2, 2) = Players_CHR(Compare) And Grid_Set(0, 0) = 0 Then Grid_Set(0, 0) = Players_CHR(Players_Turn) CPU_Moved = True Exit Sub '// 'Now checking diagonal /, do we have 2? ElseIf Grid_Set(0, 2) = Players_CHR(Compare) And Grid_Set(1, 1) = Players_CHR(Compare) And Grid_Set(2, 0) = 0 Then Grid_Set(2, 0) = Players_CHR(Players_Turn) CPU_Moved = True Exit Sub ElseIf Grid_Set(0, 2) = Players_CHR(Compare) And Grid_Set(2, 0) = Players_CHR(Compare) And Grid_Set(1, 1) = 0 Then Grid_Set(1, 1) = Players_CHR(Players_Turn) CPU_Moved = True Exit Sub '// ElseIf Grid_Set(1, 1) = Players_CHR(Compare) And Grid_Set(2, 0) = Players_CHR(Compare) And Grid_Set(0, 2) = 0 Then Grid_Set(0, 2) = Players_CHR(Players_Turn) CPU_Moved = True Exit Sub End If '// 'Now checking rows consiting 2 If Not CPU_Moved Then For j = 0 To 2 If Grid_Set(j, 0) = Players_CHR(Compare) And Grid_Set(j, 1) = Players_CHR(Compare) And Grid_Set(j, 2) = 0 Then Grid_Set(j, 2) = Players_CHR(Players_Turn) CPU_Moved = True Exit For '// ElseIf Grid_Set(j, 0) = Players_CHR(Compare) And Grid_Set(j, 2) = Players_CHR(Compare) And Grid_Set(j, 1) = 0 Then Grid_Set(j, 1) = Players_CHR(Players_Turn) CPU_Moved = True Exit For '// ElseIf Grid_Set(j, 1) = Players_CHR(Compare) And Grid_Set(j, 2) = Players_CHR(Compare) And Grid_Set(j, 0) = 0 Then Grid_Set(j, 0) = Players_CHR(Players_Turn) CPU_Moved = True Exit For '// 'Now checking cols consiting 2 ElseIf Grid_Set(0, j) = Players_CHR(Compare) And Grid_Set(1, j) = Players_CHR(Compare) And Grid_Set(2, j) = 0 Then Grid_Set(2, j) = Players_CHR(Players_Turn) CPU_Moved = True Exit For '// ElseIf Grid_Set(0, j) = Players_CHR(Compare) And Grid_Set(2, j) = Players_CHR(Compare) And Grid_Set(1, j) = 0 Then Grid_Set(1, j) = Players_CHR(Players_Turn) CPU_Moved = True Exit For '// ElseIf Grid_Set(1, j) = Players_CHR(Compare) And Grid_Set(2, j) = Players_CHR(Compare) And Grid_Set(0, j) = 0 Then Grid_Set(0, j) = Players_CHR(Players_Turn) CPU_Moved = True Exit For End If Next End If End Sub
Last edited by T.Jackson; - 5th May 2007 at 10:27.
|
VB Source Portion B
Code:Public Sub CPU_Makes_Move() '----------------------------------------------------------------------------- '*Here we check for 2 or more of the player's chr on the same row or col, 'the odds that we generate determine as to if we apply the move. '----------------------------------------------------------------------------- '// Dim Apply_Move As Boolean 'Allow CPU to apply calculated move if set true Dim i As Long 'General working var Dim j As Long '"" Dim CPU_Odds As Long 'Random odds based on difficulty setting '(to apply or not to apply the calulated move) CPU_Moved = False '// For i = 0 To (Rnd * 100) + 1 CPU_Odds = (Rnd * 100) 'Rnd num of samples (really scramble it) Next '// 'chance % that CPU will make calculated move Select Case Game_Difficulty Case 0 'Easy, 60% If CPU_Odds <= 60 Then Apply_Move = True Case 1 'Norm, 80% If CPU_Odds <= 80 Then Apply_Move = True Case 2 'hard, 95% If CPU_Odds <= 95 Then Apply_Move = True End Select '// If Apply_Move Then 'Flag set? '// 'Is there a winning possibility in the next move for CPU? Call Perform_Calculated_Move(1) '// 'Lets analyze player's game play, something to block? If Not CPU_Moved Then Call Perform_Calculated_Move(0) End If '// '----------------------------------------------------------------------------- '(Nothing to analyze, nothing to win nor block) 'Pick middle if empty or decide on corner to pick (depending on player's moves) '----------------------------------------------------------------------------- If Not CPU_Moved Then If Grid_Set(1, 1) = 0 Then 'Middle CPU_Moved = True Grid_Set(1, 1) = Players_CHR(Players_Turn) ElseIf Grid_Set(2, 2) = 0 Then 'Bottom right? If Grid_Set(1, 2) = Players_CHR(0) Or Grid_Set(2, 1) = Players_CHR(0) Then CPU_Moved = True Grid_Set(2, 2) = Players_CHR(Players_Turn) End If ElseIf Grid_Set(0, 0) = 0 Then 'Top left? If Grid_Set(0, 2) <> Players_CHR(0) Then CPU_Moved = True Grid_Set(0, 0) = Players_CHR(Players_Turn) End If ElseIf Grid_Set(0, 2) = 0 Then 'Top right? If Grid_Set(0, 0) <> Players_CHR(0) Then CPU_Moved = True Grid_Set(0, 2) = Players_CHR(Players_Turn) End If ElseIf Grid_Set(2, 0) = 0 Then 'Bottom left? CPU_Moved = True Grid_Set(2, 0) = Players_CHR(Players_Turn) End If End If '// '----------------------------------------------------------------------------- 'Look for row / col with CPU's prior moves, then check for empty 'col or row, if that fails look for one of player's prior moves. '----------------------------------------------------------------------------- '// For j = 1 To 0 Step -1 If Not CPU_Moved Then For i = 0 To 2 If Grid_Set(0, i) = Players_CHR(j) And Grid_Set(2, i) = 0 And Grid_Set(1, i) = 0 Then Grid_Set(1, i) = Players_CHR(Players_Turn) CPU_Moved = True Exit For ElseIf Grid_Set(1, i) = Players_CHR(j) And Grid_Set(2, i) = 0 And Grid_Set(0, i) = 0 Then Grid_Set(0, i) = Players_CHR(Players_Turn) CPU_Moved = True Exit For ElseIf Grid_Set(2, i) = Players_CHR(j) And Grid_Set(1, i) = 0 And Grid_Set(0, i) = 0 Then Grid_Set(0, i) = Players_CHR(Players_Turn) CPU_Moved = True Exit For End If Next End If '// 'Row If Not CPU_Moved Then For i = 0 To 2 If Grid_Set(i, 0) = Players_CHR(j) And Grid_Set(i, 2) = 0 And Grid_Set(i, 1) = 0 Then Grid_Set(i, 1) = Players_CHR(Players_Turn) CPU_Moved = True Exit For ElseIf Grid_Set(i, 1) = Players_CHR(j) And Grid_Set(i, 2) = 0 And Grid_Set(i, 0) = 0 Then Grid_Set(i, 0) = Players_CHR(Players_Turn) CPU_Moved = True Exit For ElseIf Grid_Set(i, 2) = Players_CHR(j) And Grid_Set(i, 1) = 0 And Grid_Set(i, 0) = 0 Then Grid_Set(i, 0) = Players_CHR(Players_Turn) CPU_Moved = True Exit For End If Next End If '// 'No prior CPU moves?, find empty col If Not CPU_Moved Then For i = 0 To 2 If Grid_Set(0, i) = 0 And Grid_Set(2, i) = 0 And Grid_Set(1, i) = 0 Then Grid_Set(0, i) = Players_CHR(Players_Turn) CPU_Moved = True Exit For End If Next End If '// 'No empty col?, find row If Not CPU_Moved Then For i = 0 To 2 If Grid_Set(i, 0) = 0 And Grid_Set(i, 2) = 0 And Grid_Set(i, 1) = 0 Then Grid_Set(i, 0) = Players_CHR(Players_Turn) CPU_Moved = True Exit For End If Next End If Next '// Else 'The odds are on the players side, make move by chance '// 'No brainer move', (go fetch any rnd pos) Call Find_Random_Spot End If '// Players_Turn = Players_Turn + 1 'Player makes next turn Players_Turn = Players_Turn Mod 2 'Limit val to 1, player's take successive turns Move_Count = Move_Count + 1 'Keep track of moves, max of 9 Call Scrn_Render 'Render graphics Call Check_For_Win 'Check for wining line End Sub
Members who have read this thread : 1You do not have permission to view the list of names.
Posting Permissions
Bookmarks