The issues of Leela are not caused by weak or bogus code - even if there are some bugs in Leela's code - these issues arises from the used technique.M ANSARI wrote: ↑Sat Feb 16, 2019 4:22 pm I think Lc0 is just giving us an idea of proof of concept in NN as was shown with A0 with Google. The potential is there, but to be honest Lc0 would not be even on my top 10 list of engines to use if I wanted to analyze a chess game. At least not a stand alone engine. It can miss one move tactics that really are very simple to see even for a human ... and after analyzing some of A0 games, I saw one move tactical misses as well. Lc0 also has a serious thing with the endgame that some people are politely calling "trolling" ... but I think that this is just poorly written software or poorly written search code. It just misses way too many wins in games it is completely winning and endlessly prolongs games and sometimes even misses wins in clear cut endgames. A good example would be in the amazing game that it won ... I mean promote to a rook???? ... I mean come on that is just stupid! No doubt all this will be fixed, especially if some of the talented chess coders on the SF team or on Houdini team or on Komodo team get involved. I think the proof of concept of NN has been proven beyond a shadow of a doubt, and it is time to get everyone on the band wagon.
As AB type engines have their own strong and weak side, NN type engines have also their strong and weak side.
It is pity but perfect chess engine does not exist.