Yahoo Web Search

Search results

1. math.mit.edu › ~msimkinMichael Simkin's Homepage - MIT Mathematics

   math.mit.edu › ~msimkin

   • Cached

   Following my PhD, I spent three years as a postdoctoral fellow at Harvard's Center of Mathematical Sciences and Applications. I am interested in using randomized algorithms to answer existential, enumerative, and structural questions in combinatorics.

2. Images

   • 
   • 
   • 
   • 
   • 

   View all

3. math.mit.edu › ~msimkin › filesMichael Simkin j Massachusetts Institute of Technology

   math.mit.edu › ~msimkin › files

   Michael Simkin j Massachusetts Institute of Technology. 2020 - 2023: Postdoctoral fellow, Center of Mathematical Sciences and Applica-tions, Harvard University. Education. Hebrew University of Jerusalem, Israel. 2014 - 2020: PhD, Einstein Institute of Mathematics and Federmann Center for the Study of Rationality. Adviser: Prof. Nati Linial.

4. news.harvard.edu › gazette › storyHarvard mathematician answers 150-year-old chess problem

   news.harvard.edu › gazette › story

   • Cached

   Jan 21, 2022 · Michael Simkin, a postdoctoral fellow at the Center of Mathematical Sciences and Applications, calculated that there are about (0.143n) n ways the queens can be placed so none are attacking each other on giant n-by-n chessboards.

5. www.sciencealert.com › a-harvard-mathematician-hasA Harvard Mathematician Has Basically Solved an Epic, 150 ...

   www.sciencealert.com › a-harvard-mathematician-has

   • Cached

   Jan 25, 2022 · In July 2021, one such challenge was finally solved – at least, up to a point. Mathematician Michael Simkin, from Harvard University in Massachusetts, put his mind to the n-queens problem that has been puzzling experts since it was first imagined in the 1840s.

6. www.math.harvard.edu › michael-simkin-answers-nMichael Simkin Answers n-Queens Problem - Harvard Math

   www.math.harvard.edu › michael-simkin-answers-n

   Michael Simkin, post-doctoral fellow at Harvard’s CMSA, has an answer for the 150-year-old chess-based n-queens problem. An article on the n-queens problem and its answer is in The Harvard Gazette. The paper “The number of n-queens configurations” is available on arXiv.org.

7. scitechdaily.com › harvard-mathematician-resolvesHarvard Mathematician Resolves 150-Year-Old Chess Problem

   scitechdaily.com › harvard-mathematician-resolves

   • Cached

   Jan 27, 2022 · Michael Simkin, a postdoctoral fellow at the Center of Mathematical Sciences and Applications, calculated that there are about (0.143n)n ways the queens can be placed so none are attacking each other on giant n-by-n chessboards. Understanding the Equation and Its Implications.

8. People also ask

   Why did Simkin stop focusing on the Queens?

   • The problem was always at the back of his mind, and he came back to it when he realized he had to start focusing on spaces the queens would be rather than giving equal weight to each space. Even though it’s theoretically possible to get a bit closer to an even more exact answer, Simkin for now is happy to let someone else come to it.

   Harvard mathematician answers 150-year-old chess problem

   news.harvard.edu/gazette/story/2022/01/harvard-mathematician-answers-150-year-old-chess-problem/

   See all results for this question

   How did Simkin calculate a maximum number of configurations?

   • Simkin was able to calculate a maximum number of configurations by tracking the number of spaces not under attack after the position of each additional new queen was revealed. This maximum value matched his minimum one almost perfectly, allowing Simkin to conclude that he’d just about pinpointed the actual number of n -queens configurations.

   Quanta Magazine

   www.quantamagazine.org/mathematician-answers-chess-problem-about-attacking-queens-20210921/

   See all results for this question

   How did Simkin and Luria build a toroidal board?

   • Simkin and Luria attempted to build configurations on the toroidal board using a two-part recipe. At each step, they placed a queen at random, choosing any space with equal likelihood as long as it was available. They then blocked off all the spaces that it could attack.

   Quanta Magazine

   www.quantamagazine.org/mathematician-answers-chess-problem-about-attacking-queens-20210921/

   See all results for this question

   Where can I find Simkin's paper on chess?

   • Simkin's paper on the solution is available on the preprint server arXiv. On one level, chess seems like a simple game: 64 individual black or white squares, 16 pieces per side, and two competitors striving for conquest.

   A Harvard Mathematician Has Basically Solved an Epic, 150-Year-Old

   www.sciencealert.com/a-harvard-mathematician-has-solved-an-epic-150-year-old-chess-problem

   See all results for this question

9. www.quantamagazine.org › mathematician-answersMathematician Answers Chess Problem About Attacking Queens

   www.quantamagazine.org › mathematician-answers

   • Cached

   Sep 21, 2021 · It is the earliest version of a mathematical question called the n-queens problem whose solution Michael Simkin, a postdoctoral fellow at Harvard University’s Center of Mathematical Sciences and Applications, zeroed in on in a paper posted in July.