Search results

Jump to: navigation, search
  • ...). ''[http://www.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-1.html The Problem with Threads]''. Technical Report No. UCB/EECS-2006-1, [[University of Cali
    25 KB (3,329 words) - 21:14, 28 March 2022
  • ...ackup an uncertain Monte Carlo score. This was solved. For chess this same problem was solved around the time [[Quiescence Search|quiescent search]] was devel * [[Marvin Minsky]] ('''1954'''). ''Neural Nets and the Brain Model Problem''. Ph.D. dissertation, [https://en.wikipedia.org/wiki/Princeton_University
    76 KB (10,439 words) - 14:01, 10 August 2023
  • ...isc.edu/%7Efinton/qcontroller.html Q-Learning Controller for the Cart-Pole Problem]</ref> , but was soon employed industrially to evolve strategies for automa ...]] ('''1977'''). ''King and Rook Against King: Historical Background and a Problem on the Infinite Board''. [[Advances in Computer Chess 1]]</ref> , Donald Mi
    24 KB (3,641 words) - 21:59, 3 July 2021
  • * [http://chesspuzzles.com/mate-in-two Mate in Two Problem | Chess Puzzles!]
    8 KB (1,005 words) - 17:35, 23 April 2018
  • ...two moves away from [[Checkmate|checkmate]], known as the [[Mate-in-two]] problem.
    9 KB (1,246 words) - 17:43, 23 April 2018
  • Turing addressed the problem of [[Artificial Intelligence|artificial intelligence]], and proposed an exp
    28 KB (4,173 words) - 09:54, 14 November 2020
  • The supervised problem of regression applied to [[Automated Tuning#MoveAdaption|move adaptation]] ...Knowledge from Grandmaster Games. Part 1: Grandmasters have Insights - the Problem is what to Incorporate into Practical Problems.'' [[ICGA Journal#10_1|ICCA
    91 KB (12,241 words) - 21:01, 28 March 2022
  • ...ion is similar to what would happen if you solved a weighted least squares problem where the weights are determined by how often a particular type of position
    28 KB (4,063 words) - 21:06, 28 March 2022
  • ...sporadically ad hoc and seriously thought about how to improve it. One big problem was that none of us was (or is) a good chess player and by then the program
    14 KB (2,124 words) - 17:07, 16 November 2020
  • ...Vasily Vladimirov]], [[Vitaly Vygodsky]] ('''1994'''). ''Solving Shannon's Problem: Ways and Means''. [[Advances in Computer Chess 7]]
    38 KB (4,367 words) - 09:31, 28 March 2021
  • * [https://groups.google.com/d/msg/fishcooking/0uRw0Zila0M/s2siUjVzFFwJ Problem with CLOP and clop-cutechess-cli.py? (long post)] by joster, [[Computer Che
    6 KB (884 words) - 23:12, 21 January 2020
  • ...N [[Iteration|iterations]] regardless of the dimension of the optimization problem - opposed to FDSA, which needs p + 1 objective function measurements or sim
    18 KB (2,427 words) - 16:42, 2 June 2021
  • ...rg/wiki/Dancing_Links Dancing Links] finds all solutions to an exact cover problem. Backtracking is further applied to solving [https://en.wikipedia.org/wiki/ ...atician#RGeist|Robert Geist]] ('''1984'''). ''The Crippled Queen Placement Problem''. [https://dblp.uni-trier.de/db/journals/scp/scp4.html Science of Computer
    23 KB (3,095 words) - 10:16, 26 June 2021
  • ...le/10.1007%2FBF00940812 Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm]''. [http://www.springer.com/mathematics ...ps://en.wikipedia.org/wiki/Travelling_salesman_problem Travelling salesman problem], in [[Learning|machine learning]], in training of [[Neural Networks|neural
    30 KB (4,044 words) - 13:16, 18 September 2020
  • ...data words <ref>[https://www.stmintz.com/ccc/index.php?id=191935 Re: Chess problem solving] by [[Timo Saari]], [[CCC]], October 05, 2001</ref>, optimized for
    5 KB (808 words) - 10:10, 29 February 2020
  • .... They would divide up the work, and each computer would solve part of the problem. In effect, the program was like a small business organization, with a mana
    12 KB (1,783 words) - 17:57, 26 December 2019
  • ...as a {https://en.wikipedia.org/wiki/Multi-armed_bandit multi-armed bandit] problem. [[Christopher D. Rosin#PUCT|PUCT]] modifies the original policy by approxi ...Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows''. Evostar 2011, [http://www.lamsade.dauphine.fr/~cazenav
    76 KB (10,188 words) - 16:36, 1 December 2021
  • ...f Shaw]], [[Herbert Simon]] ('''1958'''). ''Chess Playing Programs and the Problem of Complexity''. IBM Journal of Research and Development, Vol. 4, No. 2, pp ...ps://en.wikipedia.org/wiki/Homicidal_chauffeur_problem Homicidal chauffeur problem - Wikipedia]</ref>
    37 KB (5,099 words) - 16:20, 1 December 2021
  • ...h actions yield the most reward by trying them. The reinforcement learning problem is deeply indebted to the idea of [https://en.wikipedia.org/wiki/Markov_dec * [[Marvin Minsky]] ('''1954'''). ''Neural Nets and the Brain Model Problem''. Ph.D. dissertation, [https://en.wikipedia.org/wiki/Princeton_University
    137 KB (18,484 words) - 00:18, 19 December 2021
  • ...e also pondering chess-playing machines. Alex Bernstein only knew that the problem was hot ... Bernstein also mentioned that he was working on the problem to [https://en.wikipedia.org/wiki/Edward_Lasker Dr. Edward Lasker], a well-
    11 KB (1,607 words) - 18:38, 25 February 2021

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)