• Login
    View Item 
    •   Home
    • Student Scholarship
    • Honors Theses
    • View Item
    •   Home
    • Student Scholarship
    • Honors Theses
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of SSDRCommunitiesPublication DateAuthorsTitlesSubjectsThis CollectionPublication DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Digital Repository Deposit Agreement

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Topspin: Oval-Track Puzzle, Taking Apart The Topspin One Tile At A Time

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Fitzgerald_Elizabeth.doc
    Size:
    498.5Kb
    Format:
    Microsoft Word
    DownloadPDF Variant
    Thumbnail
    Name:
    auto_convert.pdf
    Size:
    506.4Kb
    Format:
    PDF
    Download
    Title
    Topspin: Oval-Track Puzzle, Taking Apart The Topspin One Tile At A Time
    Author
    Fitzgerald, Elizabeth
    Date
    2015
    Subject
    algebra
    math
    oval-track
    permutations
    puzzle
    topspin
    
    Metadata
    Show full item record
    URI
    http://hdl.handle.net/20.500.13013/607
    Abstract
    A Topspin “Oval Track” puzzle consists of 20 numbered tiles in an oval-shaped track and a flipping window that reverses the 4 tiles in the window. The solvability of the puzzle uses permutations which are combinations where the order matters. A puzzle is considered solvable if each permutation in can be mapped to a spot in the original position through the three different moves the puzzle can make; a left shift, a right shift, and the flip which reverses the order of the 4 tiles in the window. I wanted to find out what math was involved in solving this puzzle. I had certain topics that I wanted to find out more information about, but the major question I had was “what is the fewest number of moves it takes to solve a puzzle”. Other topics I had were what made a puzzle unsolvable and what other types of puzzles use the same kind of math to solve them. To construct this research, I had read different scholarly articles that talked about the Topspin as well as physically looked at the puzzle and see how it works. I had found that there was no way to determine the fewest number of moves it takes to solve a puzzle since it’s impossible to decide what a “more scrambled” puzzle is compared to another. One scrambled puzzle might look completely different from another, and still have the same number of moves to solve it. In addition to this, I was also able to find that the Rubik’s Cube is solved like the Topspin.
    Advisor
    Travers, Brian
    Department
    Mathematics
    Degree
    Bachelor of Science (BS)
    Collections
    Mathematics Honors Theses
    Honors Theses

    entitlement

     
    DSpace software (copyright © 2002 - 2025)  DuraSpace
    Quick Guide | Contact Us
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.