Oracynx

Hello 🙏

const CodingOIer = {
    pronouns: "He" | "Him",
    code: ["C/C++", "Python", "HTML", "JavaScript"],
    askMeAbout: ["Olympiad in Informatics (OI)", "Luogu", "Web", "Python", "Games"],
    funFact: "There are two ways to write error-free programs; only the third one works"
};

CodingOIer's github stats

My GPG Public Key

I love connecting with different people so if you want to say hi, I’ll be happy to meet you more! :)

CodingOIer 的社区国际象棋锦标赛

English Version

当前状态:正在对局

下一步需白棋走棋。

参与方法:

或者手动提交 Issue:

在本 repoIssue 界面提交一个新的 Issue,标题如下:

下棋逻辑实现比较简陋,部分特殊移动方式可能无法使用,需要吃掉对方的王才算胜利

到达对方底线的兵将被自动升变为后,暂不支持自行决定。

可以查看 git log / documents/log.md 获取结果,或直接查看下面的棋盘。

如果遇到问题,请发送邮件到 i@wanghongtian.com 或提交 Issue,但是由于 Issue 可能堆积,有可能无法看到。

同样的,欢迎 PR。

  A B C D E F G H
8
7
6
5
4
3
2
1

CodingOIer’s Community Chess Championship

中文版本

Current status: PLAYING

The next step requires WHITE chess moves.

How to participate:

Or submit an issue manually:

Submit a new issue in the Issue interface of this repo in the title format:

The logic of chess is relatively simple, and some special moves may not be available. You need to capture the opponent’s king to win.

Pawns that reach the opponent’s bottom line will be automatically promoted to the back, and you can’t decide for yourself at this time.

You can check git log / documents/log.md to get the results, or just look at the board below.

If you encounter any problems, please send an email to i@wanghongtian.com or submit an issue, but since issues may be piled up, they may not be visible.

Likewise, PRs are welcome.

  A B C D E F G H
8
7
6
5
4
3
2
1