Jump to content
 







Main menu
   


Navigation  



Main page
Contents
Current events
Random article
About Wikipedia
Contact us
Donate
 




Contribute  



Help
Learn to edit
Community portal
Recent changes
Upload file
 








Search  

































Create account

Log in
 









Create account
 Log in
 




Pages for logged out editors learn more  



Contributions
Talk
 



















Contents

   



(Top)
 


1 See also  





2 References  





3 External links  














Efficiently updatable neural network






Deutsch



 

Edit links
 









Article
Talk
 

















Read
Edit
View history
 








Tools
   


Actions  



Read
Edit
View history
 




General  



What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Wikidata item
 




Print/export  



Download as PDF
Printable version
 
















Appearance
   

 






From Wikipedia, the free encyclopedia
 


Anefficiently updatable neural network (NNUE, a Japanese wordplay on Nue, sometimes stylised as ƎUИИ) is a neural network-based evaluation function whose inputs are piece-square tables, or variants thereof like the king-piece-square table.[1] NNUE is used primarily for the leaf nodes of the alpha–beta tree.[2] While being slower than handcrafted evaluation functions, NNUE does not suffer from the 'blindness beyond the current move' problem.[3]

NNUE was invented by Yu Nasu and introduced to computer shogi in 2018.[4][5] On 6 August 2020, NNUE was for the first time ported to a chess engine, Stockfish 12.[6][7] Since 2021, all of the top rated classical chess engines such as Komodo Dragon have an NNUE implementation to remain competitive.

NNUE runs efficiently on central processing units without a requirement for a graphics processing unit (GPU).

The neural network used for the original 2018 computer shogi implementation consists of four weight layers: W1 (16-bit integers) and W2, W3 and W4 (8-bit). It has 4 fully-connected layers, ReLU activation functions, and outputs a single number, being the score of the board.

W1 encoded the king's position and therefore this layer needed only to be re-evaluated once the king moved. It used incremental computation and single instruction multiple data (SIMD) techniques along with appropriate intrinsic instructions.[4]

See also[edit]

References[edit]

  1. ^ Gary Linscott (April 30, 2021). "NNUE". GitHub. Retrieved December 12, 2020.
  • ^ "Stockfish 12". Stockfish Blog. Retrieved 19 October 2020.
  • ^ "Stockfish - Chessprogramming wiki". www.chessprogramming.org. Retrieved 2020-08-18.
  • ^ a b Yu Nasu (April 28, 2018). "Efficiently Updatable Neural-Network-based Evaluation Function for computer Shogi" (PDF) (in Japanese).
  • ^ Yu Nasu (April 28, 2018). "Efficiently Updatable Neural-Network-based Evaluation Function for computer Shogi (Unofficial English Translation)" (PDF). GitHub.
  • ^ "Introducing NNUE Evaluation". 6 August 2020.
  • ^ Joost VandeVondele (July 25, 2020). "official-stockfish / Stockfish, NNUE merge". GitHub.
  • External links[edit]


    Retrieved from "https://en.wikipedia.org/w/index.php?title=Efficiently_updatable_neural_network&oldid=1222132973"

    Categories: 
    Evaluation methods
    Artificial neural networks
    Japanese inventions
    Computer shogi
    Computer chess
    Hidden categories: 
    CS1 Japanese-language sources (ja)
    Articles with short description
    Short description is different from Wikidata
     



    This page was last edited on 4 May 2024, at 02:32 (UTC).

    Text is available under the Creative Commons Attribution-ShareAlike License 4.0; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.



    Privacy policy

    About Wikipedia

    Disclaimers

    Contact Wikipedia

    Code of Conduct

    Developers

    Statistics

    Cookie statement

    Mobile view



    Wikimedia Foundation
    Powered by MediaWiki