|
Darkforest
Darkforest is a computer go program developed by Meta Platforms, based on deep learning techniques using a convolutional neural network. Its updated version Darkfores2 combines the techniques of its predecessor with Monte Carlo tree search. The MCTS effectively takes tree search methods commonly seen in computer chess programs and randomizes them. With the update, the system is known as Darkfmcts3. Darkforest is of similar strength to programs like CrazyStone and Zen. It has been tested against a professional human player at the 2016 UEC cup. Google's AlphaGo program won against a professional player in October 2015 using a similar combination of techniques. Darkforest is named after Liu Cixin's science fiction novel ''The Dark Forest''. Background Competing with top human players in the ancient game of Go has been a long-term goal of artificial intelligence. Go’s high branching factor makes traditional search techniques ineffective, even on cutting-edge hardware, and Go’s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Go UEC Cup
The Computer Go UEC Cup is an annual worldwide computer Go tournament held at the University of Electro-Communications (UEC) in Tokyo Tokyo (; ja, 東京, , ), officially the Tokyo Metropolis ( ja, 東京都, label=none, ), is the capital and largest city of Japan. Formerly known as Edo, its metropolitan area () is the most populous in the world, with an estimated 37.468 ..., Japan since 2007. The winners of the tournament would then play exhibition games against a professional Go player. The tournament was typically structured as a preliminary Swiss-system invitational to determine challengers (with the previous year's UEC winners excluded), then a knockout tournament of sixteen players to determine the champion. UEC Cup was terminated after its 10th edition in 2017 and was succeeded by AI Ryusei, a new computer Go tournament sponsored by Japanese Igo & Shogi Channel. In 2019, the University of Electro-Communications hosted the renewed 11th UEC Cup with new sponsors. His ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
AlphaGo
AlphaGo is a computer program that plays the board game Go (game), Go. It was developed by DeepMind Technologies a subsidiary of Google (now Alphabet Inc.). Subsequent versions of AlphaGo became increasingly powerful, including a version that competed under the name AlphaGo Master, Master. After retiring from competitive play, AlphaGo Master was succeeded by an even more powerful version known as AlphaGo Zero, which was completely Self-play (reinforcement learning technique), self-taught without learning from human games. AlphaGo Zero was then generalized into a program known as AlphaZero, which played additional games, including chess and shogi. AlphaZero has in turn been succeeded by a program known as MuZero which learns without being taught the rules. AlphaGo and its successors use a Monte Carlo tree search algorithm to find its moves based on knowledge previously acquired by machine learning, specifically by an artificial neural network (a deep learning method) by extensi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Go
Computer Go is the field of artificial intelligence (AI) dedicated to creating a computer program that plays the traditional board game Go. The field is sharply divided into two eras. Before 2015, the programs of the era were weak. The best efforts of the 1980s and 1990s produced only AIs that could be defeated by beginners, and AIs of the early 2000s were intermediate level at best. Professionals could defeat these programs even given handicaps of 10+ stones in favor of the AI. Many of the algorithms such as alpha-beta minimax that performed well as AIs for checkers and chess fell apart on Go's 19x19 board, as there were too many branching possibilities to consider. Creation of a human professional quality program with the techniques and hardware of the time was out of reach. Some AI researchers speculated that the problem was unsolvable without creation of human-like AI. The application of Monte Carlo tree search to Go algorithms provided a notable improvement in the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nature (journal)
''Nature'' is a British weekly scientific journal founded and based in London, England. As a multidisciplinary publication, ''Nature'' features peer-reviewed research from a variety of academic disciplines, mainly in science and technology. It has core editorial offices across the United States, continental Europe, and Asia under the international scientific publishing company Springer Nature. ''Nature'' was one of the world's most cited scientific journals by the Science Edition of the 2019 ''Journal Citation Reports'' (with an ascribed impact factor of 42.778), making it one of the world's most-read and most prestigious academic journals. , it claimed an online readership of about three million unique readers per month. Founded in autumn 1869, ''Nature'' was first circulated by Norman Lockyer and Alexander Macmillan as a public forum for scientific innovations. The mid-20th century facilitated an editorial expansion for the journal; ''Nature'' redoubled its efforts in exp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Applied Machine Learning
Machine learning (ML) is a field of inquiry devoted to understanding and building methods that 'learn', that is, methods that leverage data to improve performance on some set of tasks. It is seen as a part of artificial intelligence. Machine learning algorithms build a model based on sample data, known as training data, in order to make predictions or decisions without being explicitly programmed to do so. Machine learning algorithms are used in a wide variety of applications, such as in medicine, email filtering, speech recognition, agriculture, and computer vision, where it is difficult or unfeasible to develop conventional algorithms to perform the needed tasks.Hu, J.; Niu, H.; Carrasco, J.; Lennox, B.; Arvin, F.,Voronoi-Based Multi-Robot Autonomous Exploration in Unknown Environments via Deep Reinforcement Learning IEEE Transactions on Vehicular Technology, 2020. A subset of machine learning is closely related to computational statistics, which focuses on making predicti ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Go And Mathematics
The game of Go is one of the most popular games in the world. As a result of its elegant and simple rules, the game has long been an inspiration for mathematical research. Shen Kuo, an 11th century Chinese scholar, estimated in his ''Dream Pool Essays'' that the number of possible board positions is around 10172. In more recent years, research of the game by John H. Conway led to the invention of the surreal numbers and contributed to development of combinatorial game theory (with Go Infinitesimals being a specific example of its use in Go). Computational complexity Generalized Go is played on ''n'' × ''n'' boards, and the computational complexity of determining the winner in a given position of generalized Go depends crucially on the ko rules. Go is “almost” in PSPACE, since in normal play, moves are not reversible, and it is only through capture that there is the possibility of the repeating patterns necessary for a harder complexity. Without ko Without ko, Go is PSPACE ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Synchronization (computer Science)
In computer science, synchronization refers to one of two distinct but related concepts: synchronization of processes, and synchronization of data. ''Process synchronization'' refers to the idea that multiple processes are to join up or handshake at a certain point, in order to reach an agreement or commit to a certain sequence of action. ''Data synchronization'' refers to the idea of keeping multiple copies of a dataset in coherence with one another, or to maintain data integrity. Process synchronization primitives are commonly used to implement data synchronization. The need for synchronization The need for synchronization does not arise merely in multi-processor systems but for any kind of concurrent processes; even in single processor systems. Mentioned below are some of the main needs for synchronization: '' Forks and Joins:'' When a job arrives at a fork point, it is split into N sub-jobs which are then serviced by n tasks. After being serviced, each sub-job waits until al ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stochastic Gradient Descent
Stochastic gradient descent (often abbreviated SGD) is an iterative method for optimizing an objective function with suitable smoothness properties (e.g. differentiable or subdifferentiable). It can be regarded as a stochastic approximation of gradient descent optimization, since it replaces the actual gradient (calculated from the entire data set) by an estimate thereof (calculated from a randomly selected subset of the data). Especially in high-dimensional optimization problems this reduces the very high computational burden, achieving faster iterations in trade for a lower convergence rate. While the basic idea behind stochastic approximation can be traced back to the Robbins–Monro algorithm of the 1950s, stochastic gradient descent has become an important optimization method in machine learning. Background Both statistical estimation and machine learning consider the problem of minimizing an objective function that has the form of a sum: : Q(w) = \frac\sum_^n Q_i(w), ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Softmax Function
The softmax function, also known as softargmax or normalized exponential function, converts a vector of real numbers into a probability distribution of possible outcomes. It is a generalization of the logistic function to multiple dimensions, and used in multinomial logistic regression. The softmax function is often used as the last activation function of a neural network to normalize the output of a network to a probability distribution over predicted output classes, based on Luce's choice axiom. Definition The softmax function takes as input a vector of real numbers, and normalizes it into a probability distribution consisting of probabilities proportional to the exponentials of the input numbers. That is, prior to applying softmax, some vector components could be negative, or greater than one; and might not sum to 1; but after applying softmax, each component will be in the interval (0, 1), and the components will add up to 1, so that they can be interpreted as probab ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rectifier (neural Networks)
In the context of artificial neural networks, the rectifier or ReLU (rectified linear unit) activation function is an activation function defined as the positive part of its argument: : f(x) = x^+ = \max(0, x), where ''x'' is the input to a neuron. This is also known as a ramp function and is analogous to half-wave rectification in electrical engineering. This activation function started showing up in the context of visual feature extraction in hierarchical neural networks starting in the late 1960s. It was later argued that it has strong biological motivations and mathematical justifications. In 2011 it was found to enable better training of deeper networks, compared to the widely used activation functions prior to 2011, e.g., the logistic sigmoid (which is inspired by probability theory; see logistic regression) and its more practical counterpart, the hyperbolic tangent. The rectifier is, , the most popular activation function for deep neural networks. Rectified linear uni ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
List Of Go Terms
Players of the game of Go often use jargon to describe situations on the board and surrounding the game. Such technical terms are likely to be encountered in books and articles about Go in English as well as other languages. Many of these terms have been borrowed from Japanese, mostly when no short equivalent English term could be found. This article gives an overview of the most important terms. Use of Japanese terms Although Go originated in China, the current English and Western technical vocabulary borrows a high proportion of terms from the Japanese language because it was through Japan that the West was introduced to Go. Many of these terms are from a jargon used for technical Go writing and are to some extent specially developed for Go journalism. Some authors of English-language Go materials avoid use of Japanese technical terms, and the way they are applied can differ in subtle ways from the original meanings. A few Korean-language terms have come into use (e.g., ''ha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tenuki
is a Japanese go term also commonly used among Western players. It describes ignoring a local sequence on the board in order to play elsewhere. The maneuver is related to the concepts of '' sente'', or taking the initiative, and ''gote Gote or Göte can refer to the following: People *Göte Almqvist (1921 – 1994), Swedish ice hockey player *Göte Andersson (1909 – 1975), Swedish water polo player who competed in the 1936 Summer Olympics *Göte Blomqvist (1928 – 2003), Swed ...'', deferring to the opponent by responding to the last play. Players will ''tenuki'' when they feel that their opponent's last move does not pose an urgent threat, and they judge that playing elsewhere would be to their advantage. Experienced players try to control the flow of the game by making moves that leave them with effective follow-ups, thus forcing the opponent to respond. They look for weaknesses in the opponent's position and wait for a chance to ''tenuki'' so they can exploit those weak ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
