On 3 May, 06:48, Sanny wrote:
Not at all. If the opponent has more than two brain cells to rub
together he will win. One such winning position with the unlucky loser
trapped in a corner looks like this.
_____________
| k | * * | * * | * *|
| * *| B | * * | * * |
| * *| K | * * | B |

It should be obvious what the last move for each side was.

Ok thing has been Corrected. Now when someone has 2 Bishops game will
not stop there and you will be allowed to finish the game. And incase
computer is unable to bring Mate you have to Resign to end the game.

Unless the computer can force the theoretical win then it should offer
a draw (which would arise under the 50 move rule if the Getclub
opponent hasn't gnawed off his own arm in boredom by that stage).

You could provide a compromise kludge that will offend chess purists.
That is to implement a weak (and incorrect) version of the 3
repetitions rule such that if the program finds that moves N, N+2 and N
+4 are identical for either side and the opponents move N=N+2 then it
declares the position a draw by repetition. Strong players should not
have much difficulty triggering that rule to claim their draw when
they are down on material in a theoretically won position which
Getclub is far too weak to exploit.

Naturally getting 2 extra Bishops is worth getting a win.

You have to make the program able to obtain the win too. Tablebases
might be the easiest way here.

Regards,
Martin Brown