Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • {{Short description|Mathematical graph relating to chess}} ...aph]] that represents all legal moves of the [[chess piece]] the [[bishop (chess)|bishop]] on a [[chessboard]]. Each [[vertex (graph theory)|vertex]] repres ...
    4 KB (586 words) - 12:00, 25 October 2024
  • {{Short description|Class of mathematical game}} | title=[[Winning Ways for your Mathematical Plays]] ...
    9 KB (1,448 words) - 20:51, 11 February 2025
  • {{Short description|Mathematical graph relating to chess}} {{Chess diagram ...
    12 KB (1,750 words) - 18:26, 20 October 2024
  • | known_for = Being the chess champion of Scotland in 1964, 1966, and 1969 ...otland>{{cite web|author=McGowan, Alan|title=Alexander Munro Davie|website=Chess Scotland|url=https://www.chessscotland.com/documents/history/biographies/da ...
    9 KB (1,192 words) - 09:02, 22 August 2024
  • | [[File:3D chess moves basic octa.png|120px]] | [[File:3D chess moves basic dodeca.png|120px]] ...
    8 KB (1,106 words) - 16:42, 8 February 2025
  • In 1932 he married Zofia Rosenblatt. Schreier often played [[blindfold chess]]. ...title=The Scottish Book: Mathematics from The Scottish Café, with Selected Problems from The New Scottish Book|date=2015|publisher=Birkhäuser|isbn=978331922897 ...
    7 KB (1,065 words) - 07:11, 26 December 2024
  • | title = Extremal problems for topological indices in combinatorial chemistry {{Chess diagram ...
    17 KB (2,310 words) - 16:09, 3 March 2024
  • ...82 to 1992.<ref name="cv"/> He was general secretary of the [[János Bolyai Mathematical Society]] from 1980 to 1990, and president of the society from 1990 to 1994 ...nd Sós calls him “the great chess player”; the conference included a blitz chess tournament in his honor.</ref> ...
    17 KB (2,412 words) - 22:51, 3 February 2025
  • ...hes them from turn-based games ([[Sequential game|sequential games]]) like chess, focusing instead on real-time strategic conflicts. Differential games are related closely with [[optimal control]] problems. In an optimal control problem there is single control <math>u(t)</math> an ...
    10 KB (1,311 words) - 20:59, 20 February 2025
  • ...ter or chess), whereas George prefers to donate to competitive activities (chess or basketball). Suppose further that the donors consider the facilities [[s * In contrast, if they coordinate, they can contribute everything to the chess club, so the distribution becomes 0, 6000, 0. Now, each donor has a utility ...
    19 KB (2,744 words) - 17:39, 22 May 2024
  • ...vertices represent squares of a chessboard and edges represent moves of a chess rook. Known characterizations of the well-covered [[cubic graph]]s, well-co {{Chess diagram ...
    28 KB (3,838 words) - 08:42, 18 July 2024
  • Every finite dismantlable graph is cop-win. This can be proved by [[mathematical induction]], with a one-vertex graph (trivially won by the cop) as a base c {{Chess diagram ...
    24 KB (3,677 words) - 04:09, 23 May 2023
  • ...methods for manufacturing novel materials and algorithms to solve complex problems in computation. ...orces, or they may be dynamic states or conditions, such as positions on a chess board with moves by the players defining the edges. ...
    16 KB (2,460 words) - 15:56, 2 August 2024
  • {{Short description|Mathematical concept}} ...atical object]]s can be studied, manipulated, and used just like any other mathematical object. ...
    54 KB (7,877 words) - 14:55, 14 February 2025
  • | Yang Joon-hyuk || Department of Mathematical Sciences 20 || {{bulleted list|KAIST Presidential Scholarship recipient|Gol ...ment of Mathematics 19 || {{bulleted list|Math genius [[violin]]ist|Innate mathematical sense}} ...
    137 KB (17,204 words) - 17:00, 24 February 2025
  • The crux of ''Perceptrons'' is a number of [[mathematical proofs]] which acknowledge some of the perceptrons' strengths while also sh ...ons-An-Introduction/bams/1183533389.full |journal=Bulletin of the American Mathematical Society |volume=78 |issue=1 |pages=12–15 |doi=10.1090/S0002-9904-1972-12831 ...
    37 KB (5,465 words) - 20:39, 10 October 2024
  • ...en |archive-date=2023-03-30 }}</ref> to solve for matrix <math>X</math> in problems, where matrix <math>\boldsymbol{Z}</math> is not a sample from the populati ...ssible meaningful ways]] before solving <math>(n-1)(m-1) </math> number of problems of 2×2 form. Each problem is defined for an <math> i,j </math> pair (<math> ...
    37 KB (5,515 words) - 18:33, 8 February 2024
  • ...of logic that studies the application of logical methods to philosophical problems, often in the form of extended logical systems like [[modal logic]]. But ot ...tential quantifier]]s. An important question in mathematics is whether all mathematical truths can be grounded in the axioms of logic together with set theory. Oth ...
    97 KB (14,336 words) - 10:56, 19 February 2025
  • ...tem|Elo rating]] in a competition against other models, such as [[Computer chess|gameplay]]<ref name=":6">{{cite arXiv | eprint=2104.03113 | last1=Jones | f ...|first2=Sam |last3=Henighan |first3=Tom |last4=Brown |first4=Tom B. |last5=Chess |first5=Benjamin |last6=Child |first6=Rewon |last7=Gray |first7=Scott |last ...
    44 KB (6,432 words) - 22:52, 25 February 2025
  • A PageRank results from a mathematical algorithm based on the [[Webgraph]], created by all World Wide Web pages as ...ng method for priorities in hierarchical structures | journal = Journal of Mathematical Psychology | volume = 15 | issue = 3 | year = 1977 | pages = 234–281 | doi ...
    71 KB (10,204 words) - 07:06, 25 February 2025
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)