Käyttäjätunnus: Salasana:
Uuden käyttäjän rekisteröinti
Valvoja(t): rod03801 
 Chinese Chess

Xiangqi - Chinese Chess

Knights and Rooks may join the Xiangqi Fellowship which has additional boards for discussion and resources (links to other sites).
Pawns may not join the fellowships, but links from the Xiangqi resources board are have been copied to a Resources message.
Create a New game of Xiangqi,  Established ratings,   Provisional ratings,  The Rules of Xiangqi.
___________________________


Viestejä per sivu:
Lista keskustelualueista
Sinulla ei ole oikeutta kirjoittaa tälle alueelle. Tälle alueelle kirjoittamiseen vaadittu minimi jäsenyystaso on Brain-Sotilas.
Moodi: Kaikki voivat lähettää viestejä
Etsi viesteistä:  

4. Lokakuu 2006, 07:15:32
cheating up up 
Otsikko: can two advisors and two elephants to win a game?
to win a game without attacking pieces is possible?

4. Lokakuu 2006, 09:19:16
kleineme 
Otsikko: Re: can two advisors and two elephants to win a game?
435152: no, this a draw, because none of your remaining pieces can deliver mate, and stalemate isn't possible either

4. Lokakuu 2006, 10:32:31
cheating up up 
Otsikko: Re: can two advisors and two elephants to win a game?
kleineme:
how about the other side have a knight? it is possible.
how about the other side have a knight,a rook,and a cannon?

4. Lokakuu 2006, 10:51:54
kleineme 
Otsikko: Re: can two advisors and two elephants to win a game?
435152: sorry, but I don't understand what you mean? If you have only advisors and elephants, then you can't win, and if the other side has additional pieces then this only improves the winning chances of the other side. Or what did you mean?

8. Lokakuu 2006, 14:58:53
cheating up up 
Otsikko: Re: can two advisors and two elephants to win a game?
kleineme:
how about the other side have a knight and a cannon?
it is posssible but like the puzzle in actual playing game it is almost won't happen.

Päivämäärä ja aika
Ystävät palvelimella
Suosikki keskustelut
Yhteisöt
Päivän vinkki
Tekijänoikeudet - Copyright © 2002 - 2024 Filip Rachunek, kaikki oikeudet pidätetään.
Takaisin alkuun