I'd bet, LC0 wins that with White against any opponent of your choice, if length of game doesn't matter and you give it enough hardware- time.Uri Blass wrote: ↑Tue Jan 25, 2022 11:36 am I wonder if there are chess programs who can solve the starting position let say at 3 minutes per move not in the meaning of finding one best move but in the meaning of beating every opponent with white.
I also wonder if you can define some simple algorithm for humans how to win with white so human who follow it can win with white without computer help or at least get a position that is a simple win based on engine-engine game for every engine with rating of at least 3000.
That's started with empty hash (which doesn't matter as for LC0 anyhow, NN- cache was empty too, which doesn't really matter neither):
2k5/2p5/1q1p4/pPpPp1pp/N1P1Pp2/P4PbP/KQ4P1/8 w - - 0 1
Analysis by Lc0 v0.28.2: (net 780486, NVIDIA 3070ti, 8G NN-chache)
46.Kb3 Kb7 47.Kc2 h4 48.Kd3 Lh2 49.Ke2 Lg3 50.Kf1 Kc8 51.Db3 Kb7 52.Kg1 Da7 53.b6 Da6
+/- (1.13) Tiefe: 11/29 00:00:19 280kN
...
46.Kb3 Kb7 47.Kc2 h4 48.Kd3 Bh2 49.Ke2 Bg3 50.Kf1 Kc8 51.Qc2 Kb7 52.Qd1 Qa7 53.Qb3 Qb6 54.Kg1 Qa7 55.b6 Qa6 56.bxc7+ Kxc7 57.Kf1
+/- (1.07) Depth: 15/46 00:03:02 9371kN
Of course you must not care about eval.
And the "algorithms" for humans (which you see in the line above too, it's just Black's moves, that aren't the best ones) I described often enough already in this thread
forum3/viewtopic.php?p=918315#p918315
forum3/viewtopic.php?p=919226#p919226
forum3/viewtopic.php?p=919326#p919326
About Crystal (with or without NNUE) I'd be rather sure it wouldn't go over 50 moves- boundary nor into 3fold- traps neither in LTC, you'd just have to give it enough hardware- time to overcome the first and only possible crucial blunder (if one really wants to call it like that) 46.Nxb6+ (?) regards...
Edit: Game LC0- SF is already running, SF 220122 at 30 threads with 45'+5" TC has eval of about +6 just after LC0's first move 46.Kb3, so what?
