Talk:Efficiently updatable neural network

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

This is the talk page for discussing improvements to the Efficiently updatable neural network article.
This is not a forum for general discussion of the article's subject.

Put new text under old text. Click here to start a new topic.
New to Wikipedia? Welcome! Learn to edit; get help.

Article policies

Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL

Computing Low‑importance

	This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
Low	This article has been rated as Low-importance on the project's importance scale.

Chess Low‑importance

	Chess portal This article is within the scope of WikiProject Chess, a collaborative effort to improve the coverage of Chess on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ChessWikipedia:WikiProject ChessTemplate:WikiProject Chesschess
Low	This article has been rated as Low-importance on the project's importance scale.

Possible sources

Sun Creator^(talk) 18:15, 9 August 2020 (UTC)[reply]

Inaccurate statement that all top engines use NNUE

Specifically, this statement "Since 2021, all of the top rated classical chess engines such as Komodo Dragon have an NNUE implementation to remain competitive." is false. Lc0 is another top engine and it does not use NNUE CKing123 (talk) 23:19, 18 September 2024 (UTC)[reply]