The last possibility, and the most effective one, starts at c1.īlack has to take b1, and white can answer with f1. If we place f1 first, then the sequence becomes f1,e1,c1,b1,b2 andĪgain black is forced to take an X square. Things even more profitable, but this was a good example of usingīlack's limited capability to move to get a corner. White wants to wait before actually taking the corner, to make g4 forĮxample provides a place on the diagonal. The situation has changed toīut black was forced to place a stone at the X square g2, and thisĮnables white to take the h1 corner for sure in this case. Starting with either b1 or f1 basically leads to the same end Squares towards the east, west or south side and we already know Moves to b1, which opens the move c2 to black, or to one of the Black then plays f1, and then white either Then black would play f1 and would thus have gained a corner in Have to consider the five possible moves on the north side. The other options offer black at least two moves. Basically this only leaves us the north side, since all So we cant place our stone somewhere where it gives black multiple I hope you have done your ``homework''īy now, so lets look at the position together. Loot at the position now and try to find sequence of moves that To force black into making one or more bad moves.

Again, this isĪn extreme example of mobility difference, since black can make no See a position in which black has enclosed white. High mobility can place a stone in a lot of different places.īefore refining the definition, let's look at another example of Mobility only has a few options to choose from, while someone with One could say that mobility is theĪmount of moves that a player can make. It is this fact thatĪllows black to force white into making bad moves. More, we see that white can't make a move. The mobility strategyīesides the lack of stable disks, white has another problem in our Nice puzzle to find the best way to play. Will be 35 stones for white, and 29 for black.

In fact, assuming perfect play, the end result More stones then one would expect, but the dramatic change to 46 White has 21 stable stones in this situation. Now the white stones in the north-west corner are completely safe, To see an example of the opposite situation: suppose that white also was able to completelyĬapture one of the corners, leading to the situation 3. White has 46 stones, but not one of these disks is stable. Looking back at the example in figure 1, we see that Examples of stable stones are given in figure 2. The game, or in the middle part even, usually means that you willīe able to use that corner to gain a lot of stable disks and thus Your cornerstones, so acquiring a corner stone in the beginning of There is no way that an opponent can flip one of Good examples of stable disks areĬorner stones. Stable disks are disks that can notīe flipped by the opponent. Important reasons are stable disks and mobility. There are several reasons why the maximum disk strategy usually fails. Solution in which black wins is not that hard, but 46 stones is a You may want to try to find the best play yourself, a White will end up with all the corners, but black will have 46 If black playsĪll moves right, and white plays the best possible moves too, then White however is very limited in its moves, which allows black toįorce white into making less then perfect moves. White has 46 stones and black only 2, with 16 remaining moves. Not at all a guarantee that you will win in the end however! Consider for example This strategy is known as the maximum disk strategy. When people first learn to play Othello, they are usually tempted to getĪs many stones they can, whenever they can. The most obvious strategy is not always the best Playing Othello is like every game that is not based entirely on luck, if you want

NOV: Nederlandse Othello Vereniging The strategy to winning othello

Othello strategy