Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Chess puzzle
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Mathematical chess problems == {{Main article|Mathematical chess problem}} Some chess problems, like the [[eight queens puzzle]] or the [[knight's tour]] problem, have connections to mathematics, especially to [[graph theory]] and [[combinatorics]]. Many famous mathematicians have studied such problems, including [[Leonhard Euler|Euler]], [[Adrien-Marie Legendre|Legendre]], and [[Carl Friedrich Gauss|Gauss]]. Besides finding a solution to a particular puzzle, mathematicians are usually interested in counting the total number of possible solutions, finding solutions with certain properties, and generalization of the problems to ''n''Γ''n'' or rectangular boards.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)