Show simple item record

dc.contributor.advisorCrowe, Kathien_US
dc.contributor.authorReynolds, Ashley
dc.creatorReynolds, Ashleyen_US
dc.date2021-11-24T14:05:38.000en_US
dc.date.accessioned2021-11-29T11:32:17Z
dc.date.available2021-11-29T11:32:17Z
dc.date.issued2018-01-01en_US
dc.date.submitted2018-11-06T11:30:12-08:00en_US
dc.identifierhonors_theses/193en_US
dc.identifier.urihttp://hdl.handle.net/20.500.13013/668en_US
dc.description.abstractUsing 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.titleN-Queens Problemen_US
dc.typeThesisen_US
dc.legacy.pubstatuspublisheden_US
dc.description.departmentPsychologyen_US
dc.description.departmentMathematicsen_US
dc.date.display2018en_US
dc.type.degreeBachelor of Arts (BA)en_US
dc.type.degreeBachelor of Science (BS)en_US
dc.legacy.pubtitleHonors Thesesen_US
dc.legacy.identifierhttps://digitalcommons.salemstate.edu/cgi/viewcontent.cgi?article=1193&context=honors_theses&unstamped=1en_US
dc.legacy.identifieritemhttps://digitalcommons.salemstate.edu/honors_theses/193en_US
dc.subject.keywordn-queens problemen_US
dc.subject.keywordcombinatoricsen_US
dc.subject.keywordchessen_US
dc.subject.keywordlatin squareen_US
dc.subject.keywordlatin rectangleen_US
dc.subject.keywordcirculant matrixen_US


Files in this item

Thumbnail
Name:
Reynolds__20Ashley.pdf
Size:
217.0Kb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record