Mizar / みざー

Workaround for Japanese Windows environment

3

- Avoiding problems with incorrect encoding `UnicodeDecodeError: 'cp932' codec can't decode byte 0x85 in position 2897: illegal multibyte sequence` - Added option to output directly to file PowerShell converts encoding...

`bundle/` 以下のファイルが `.npmignore` で除外されている

1

意図的なのかもしれませんが、ブラウザ向けのビルド `bundle/shogi-${package.version}.min.js` がnpmレジストリに含まれていないようです。

ModInt 2^31 <= m < 2^32 for addition/subtruction

1

The implementation of addition and subtraction in the ModInt structure does not seem to assume $2^{31}\le m\lt 2^{32}$. ## Suggested mitigation - Addition (plan A, cast 32/64-bit integer): - Cast...

mul_mod for 2^31 < m < 2^32

2

`mul_mod` seems easily be adapted to the case 2^31 < m < 2^32 by simply improving the last subtraction borrow check. (current code: ac-library) https://github.com/atcoder/ac-library/blob/6c88a70c8f95fef575af354900d107fbd0db1a12/atcoder/internal_math.hpp#L22-L62 (current code: ac-library-rs) https://github.com/rust-lang-ja/ac-library-rs/blob/b473a615a7d7cfe4d8b26e369808cb2aa2d2f5a0/src/internal_math.rs#L19-L84 -...

u32 modulo fix

7

https://github.com/rust-lang-ja/ac-library-rs/issues/111 Fix a problem with cases like 2^31 < modulo < 2^32 due to poor implementation of ac-library's overflow/underflow check.

駒落ち局面のハフマン符号化/復号化において、落とした駒を符号化して埋める

1

https://github.com/TadaoYamaoka/cshogi/issues/17

駒落ち戦の宣言法: Methods of declaring `win` in handicap games

4

lishogiにAoba駒落ち ( https://lishogi.org/@/AobaHandicap/playing , https://lishogi.org/@/AobaHandicap_m/playing ) をBOTとして放流中ですが、Aoba駒落ち自身の判定で「入玉勝ち」を宣言した場合、その宣言がエラーとなって対局が止まってしまい、そのまま時間切れを起こしてしまうようです。 We are releasing AobaHandicap ( https://lishogi.org/@/AobaHandicap/playing , https://lishogi.org/@/AobaHandicap_m/playing ) as BOT to lishogi. However, it seems that when the player declares a "win",...

`--mine github.com/{username}` のオプションでのライセンス表示除外ですが、 `ssh://[email protected]/{username}` のようなssh接続でのURLが考慮されていないため、機能しないようです。 https://github.com/qryxip/cargo-equip/blob/b994834d2696c904f2378014e45770b2c3585fd9/src/workspace/license.rs#L58-L188

Validate the network with the time complexity O(L・φ^N)

10

Let the number of inputs be $N$ and the number of comparators be $L$. It is well known that the 0-1 principle allows the verification of networks with a computational...