Sign In

Login

Password

Forgot Password ? Sign Up

Вирішення шахів (Ukrainian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Вирішення шахів" in Ukrainian language version.

refsWebsite
Global rank Ukrainian rank
5web.archive.org
1st place
1st place
1free.fr
321st place
1,341st place
1chessok.com
low place
low place
1webcitation.org
24th place
3rd place
1computerhistory.org
2,213th place
3,154th place
1aeiveos.com
low place
low place
1doi.org
2nd place
4th place
1nih.gov
4th place
5th place
1sciencemag.org
857th place
376th place
1ieee.org
652nd place
774th place

aeiveos.com

chessok.com

computerhistory.org

archive.computerhistory.org

  • Shannon, C. (March 1950). Programming a Computer for Playing Chess (PDF). Philosophical Magazine. 7. 41 (314). Архів оригіналу (pdf) за 15 березня 2010. Процитовано 27 червня 2008.
    "With chess it is possible, in principle, to play a perfect game or construct a machine to do so as follows: One considers in a given position all possible moves, then all moves for the opponent, etc., to the end of the game (in each variation). The end must occur, by the rules of the games after a finite number of moves (remembering the 50 move drawing rule). Each of these variations ends in win, loss or draw. By working backward from the end one can determine whether there is a forced win, the position is a draw or is lost. It is easy to show, however, even with the high computing speed available in electronic calculators this computation is impractical. In typical chess positions there will be of the order of 30 legal moves. The number holds fairly constant until the game is nearly finished as shown ... by De Groot, who averaged the number of legal moves in a large number of master games. Thus a move for White and then one for Black gives about 103 possibilities. A typical game lasts about 40 moves to resignation of one party. This is conservative for our calculation since the machine would calculate out to checkmate, not resignation. However, even at this figure there will be 10120 variations to be calculated from the initial position. A machine operating at the rate of one variation per micro-second would require over 1090 years to calculate the first move!"

doi.org

free.fr

fragrieu.free.fr

  • Allis, V. (1994). PhD thesis: Searching for Solutions in Games and Artificial Intelligence (PDF). Department of Computer Science. University of Limburg. Архів оригіналу (pdf) за 20 серпня 2018. Процитовано 14 липня 2012.

ieee.org

spectrum.ieee.org

nih.gov

pubmed.ncbi.nlm.nih.gov

sciencemag.org

web.archive.org

  • Allis, V. (1994). PhD thesis: Searching for Solutions in Games and Artificial Intelligence (PDF). Department of Computer Science. University of Limburg. Архів оригіналу (pdf) за 20 серпня 2018. Процитовано 14 липня 2012.
  • Lomonosov Tablebases. Архів оригіналу за 1 травня 2013. Процитовано 24 квітня 2013.
  • Bremermann, H.J. (1965). Quantum Noise and Information. Proc. 5th Berkeley Symp. Math. Statistics and Probability. Архів оригіналу за 27 травня 2001. Процитовано 1 лютого 2016.
  • Schaeffer, Jonathan; Burch, Neil; Björnsson, Yngvi та ін. (14 вересня 2007). Checkers Is Solved. Science. 317 (5844): 1518—1522. doi:10.1126/science.1144079. PMID 17641166. Архів оригіналу за 26 березня 2009. Процитовано 21 березня 2009. (необхідна підписка)
  • Sreedhar, Suhas. Checkers, Solved!. Spectrum.ieee.org. Архів оригіналу за 25 березня 2009. Процитовано 21 березня 2009.

webcitation.org

  • Shannon, C. (March 1950). Programming a Computer for Playing Chess (PDF). Philosophical Magazine. 7. 41 (314). Архів оригіналу (pdf) за 15 березня 2010. Процитовано 27 червня 2008.
    "With chess it is possible, in principle, to play a perfect game or construct a machine to do so as follows: One considers in a given position all possible moves, then all moves for the opponent, etc., to the end of the game (in each variation). The end must occur, by the rules of the games after a finite number of moves (remembering the 50 move drawing rule). Each of these variations ends in win, loss or draw. By working backward from the end one can determine whether there is a forced win, the position is a draw or is lost. It is easy to show, however, even with the high computing speed available in electronic calculators this computation is impractical. In typical chess positions there will be of the order of 30 legal moves. The number holds fairly constant until the game is nearly finished as shown ... by De Groot, who averaged the number of legal moves in a large number of master games. Thus a move for White and then one for Black gives about 103 possibilities. A typical game lasts about 40 moves to resignation of one party. This is conservative for our calculation since the machine would calculate out to checkmate, not resignation. However, even at this figure there will be 10120 variations to be calculated from the initial position. A machine operating at the rate of one variation per micro-second would require over 1090 years to calculate the first move!"