N-Queens Problem
dc.contributor.advisor | Crowe, Kathi | en_US |
dc.contributor.author | Reynolds, Ashley | |
dc.creator | Reynolds, Ashley | en_US |
dc.date | 2021-11-24T14:05:38.000 | en_US |
dc.date.accessioned | 2021-11-29T11:32:17Z | |
dc.date.available | 2021-11-29T11:32:17Z | |
dc.date.issued | 2018-01-01 | en_US |
dc.date.submitted | 2018-11-06T11:30:12-08:00 | en_US |
dc.identifier | honors_theses/193 | en_US |
dc.identifier.uri | http://hdl.handle.net/20.500.13013/668 | en_US |
dc.description.abstract | Using combinatorics in this paper, we will discuss three different methods in solving the n-queens problem. We will find the maximum and minimum number of queens we can place on an n x n chessboard. Also, we will use latin squares, latin rectangles and circulant matrices as another method of placing the queens on a chessboard. | en_US |
dc.title | N-Queens Problem | en_US |
dc.type | Thesis | en_US |
dc.legacy.pubstatus | published | en_US |
dc.description.department | Psychology | en_US |
dc.description.department | Mathematics | en_US |
dc.date.display | 2018 | en_US |
dc.type.degree | Bachelor of Arts (BA) | en_US |
dc.type.degree | Bachelor of Science (BS) | en_US |
dc.legacy.pubtitle | Honors Theses | en_US |
dc.legacy.identifier | https://digitalcommons.salemstate.edu/cgi/viewcontent.cgi?article=1193&context=honors_theses&unstamped=1 | en_US |
dc.legacy.identifieritem | https://digitalcommons.salemstate.edu/honors_theses/193 | en_US |
dc.subject.keyword | n-queens problem | en_US |
dc.subject.keyword | combinatorics | en_US |
dc.subject.keyword | chess | en_US |
dc.subject.keyword | latin square | en_US |
dc.subject.keyword | latin rectangle | en_US |
dc.subject.keyword | circulant matrix | en_US |