How to build Connect4 game in C++

[Eleder]

I have a little problem with my C + + coding for my course. I have been request to schedule a game of pattern recognition and in my (almost) infinite perception; I decided to try to make a working version of Connect 4. The basic idea: I am using a 2D matrix as network gaming, all values are reset before the start of the game. The use of a selector function, the user can select which column to place your pieces in play. IF loop controls if the lower value of that column is zero (if not, another IF function loop moves to the location of a matrix above.

[Chaska]

Hello having same problem. The difficulty I'm having is that I comprise no idea how to obtain the program to control the game and to detect any patterns of 4 emerge. I had thought to use two very different values and just add the rows of the matrix. However, getting the work would be very uncomfortable unless he could convince people to make my way to use only the same column again and again. Any advice or tips would be greatly appreciated. Other than bear in mind that I in reality.

[Shreevats]

Subsequent to each place of a counter, confirm to observe if a matching color counter is next to the positioned counter. If yes, continue next to that axis to observe if 4 counters are in attendance. If yes, end game through win. If no, go back in the direction of placed counter and attempt a different route. Even though this is simply basic and will merely count a row if they placed counter is at the extremely end of the row. If, say, you have this:
0 0 0 X
0 0 Z 0
0 X 0 0
X 0 0 0

With Z being the positioned counter, after that the logic will not notice that as a row.

[Villiers]

There are simply a finite number of ways for the final game (depending on the size of the table). I assume the smaller wiki name plate, 7x6. In every column there are 3 technique to win (21 columns) in every row there are 4 ways in the direction of win (24 for rows), and there are 26 dissimilar ways diagonally to win. You basically have to observe the 71 dissimilar ways a person could win. Go down each column and see if there are 4 in a row from the top, from the bottom and second from the top or lower than the second. If there is a 0 in any starting position can move to the next test. If there is an off color piece in the subsequently slot that acquire checked after that move to the next test.

[Ronchi]

If you are going to perform recursion to determine this would include a check function in the direction of check the 3-8 points approximately a single point afterward call single 8 recursive functions to recurse down an address to observe if the same colors. But the problem with this approach is that each point on the network needs to be checked. If the starting point is not the end of a line of 4 then a recursive solution completed this technique will feel the group of four. For this to perform the starting point must be on one end of group 4, which means that every point on top of the board should be reviewed.

[Steyn]

I talked to my friend, and presented a more complex, but eventually an enhanced solution in my view. Since we do not want to produce pseudo-code for this I am going to outline his thought: build a container class that will carry out the works. Establish a list of two dimensions of these containers, type of list would probably be coded linked list. Have each container in 2 dimensions to be doubly linked lists with the other containers nearby. Make use of a container variable and process to preserve an active account longest straight chain of the similar kind of piece from every piece. This variable is actively updated when a piece is added. When the longest string line in any piece = 4 that piece's type wins.