Swapping rooks in a 4x4 boardRook game on chessboardThe Erasmus rook tourTwo rooks for Bobby FischerSwitch The KnightsFour free rooks for checkmateThe King's Routes Problem: How many possibilities?Interchanging Knights and RooksThe Minimized DropmateA Chess Lock Puzzle?Placing rooks on a chessboard

Who are the remaining King/Queenslayers?

Is there a maximum distance from a planet that a moon can orbit?

Methodology: Writing unit tests for another developer

Count All Possible Unique Combinations of Letters in a Word

Loss of power when I remove item from the outlet

Swapping rooks in a 4x4 board

Can Ogre clerics use Purify Food and Drink on humanoid characters?

What does the hyphen "-" mean in "tar xzf -"?

Can White Castle?

Greeting with "Ho"

Is "qch. est à mourir" considered an anglicism calqued from "sth is to die for"? How commonly is it used?

Appropriate way to say "see you tomorrow" when meeting online

Trainee keeps missing deadlines for independent learning

How dangerous are set-size assumptions?

Why does Linux list NVMe drives as /dev/nvme0 instead of /dev/sda?

How can I politely work my way around not liking coffee or beer when it comes to professional networking?

When to remove insignificant variables?

Minimum distance between holes in inner tube

Why does the Saturn V have standalone inter-stage rings?

Output of "$OSTYPE:6" on old releases of Mac OS X

Helping ease my back pain when I'm studying 13 hours everyday, even weekends

Why do textbooks often include the solutions to odd or even numbered problems but not both?

NSE Numerical IQ Test no.12: 759802, 358829, 847123,?

Are all instances of trolls turning to stone ultimately references back to Tolkien?



Swapping rooks in a 4x4 board


Rook game on chessboardThe Erasmus rook tourTwo rooks for Bobby FischerSwitch The KnightsFour free rooks for checkmateThe King's Routes Problem: How many possibilities?Interchanging Knights and RooksThe Minimized DropmateA Chess Lock Puzzle?Placing rooks on a chessboard






.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;








7












$begingroup$


You have a 4x4 chessboard with four black rooks on the top and four white rooks in the bottom.



Your goal is to swap these rooks using the minimum number of steps. It does not matter which rook is which, as long as there are four white rooks on the top and four black rooks in the bottom.



enter image description here



Chess rules apply: rooks can move any number of squares, horizontally (left and right) or vertically (up and down), as long as there is not another piece on the way. White starts. You must alternate black and white moves.










share|improve this question











$endgroup$







  • 1




    $begingroup$
    This is the type of question which might make a good secondary puzzle along the lines of "how many steps does it take to swap rooks on an nxn board"! (+1)
    $endgroup$
    – Adam
    8 hours ago







  • 1




    $begingroup$
    Yes, I thought about that. In a 3x3 board I was able to do in 14 moves, but I'm not sure if it is the optimal solution. I also don't think it would be a good idea to open a new question for a 3x3, 5x5, 8x8, etc.
    $endgroup$
    – Chaotic
    8 hours ago










  • $begingroup$
    Not necessarily, but the generalization is a worthy question to ask, though perhaps not by itself not that you've asked the instance for n = 4. Still, I do believe this should generalize quite nicely.
    $endgroup$
    – greenturtle3141
    6 hours ago










  • $begingroup$
    I'm fairly sure that for a 3*3, 9 is optimal. Set up the rooks on the f-h files and ranks 1-3 and follow these moves: 1. Rh2 Rg2 2. Rgh3 Rg3 3. Rff2 Rhg1 4. Rh1 R1g2 5. Rg1 Rh2 6. Rfg2 Rff3 7. Rf2 Rhg2 8. Rhh1 Rh2 9. Rff1 Rhh3.
    $endgroup$
    – Rewan Demontay
    4 hours ago










  • $begingroup$
    It's white rooks on the first rank, black rooks on the third, and White to move first.
    $endgroup$
    – Rewan Demontay
    4 hours ago

















7












$begingroup$


You have a 4x4 chessboard with four black rooks on the top and four white rooks in the bottom.



Your goal is to swap these rooks using the minimum number of steps. It does not matter which rook is which, as long as there are four white rooks on the top and four black rooks in the bottom.



enter image description here



Chess rules apply: rooks can move any number of squares, horizontally (left and right) or vertically (up and down), as long as there is not another piece on the way. White starts. You must alternate black and white moves.










share|improve this question











$endgroup$







  • 1




    $begingroup$
    This is the type of question which might make a good secondary puzzle along the lines of "how many steps does it take to swap rooks on an nxn board"! (+1)
    $endgroup$
    – Adam
    8 hours ago







  • 1




    $begingroup$
    Yes, I thought about that. In a 3x3 board I was able to do in 14 moves, but I'm not sure if it is the optimal solution. I also don't think it would be a good idea to open a new question for a 3x3, 5x5, 8x8, etc.
    $endgroup$
    – Chaotic
    8 hours ago










  • $begingroup$
    Not necessarily, but the generalization is a worthy question to ask, though perhaps not by itself not that you've asked the instance for n = 4. Still, I do believe this should generalize quite nicely.
    $endgroup$
    – greenturtle3141
    6 hours ago










  • $begingroup$
    I'm fairly sure that for a 3*3, 9 is optimal. Set up the rooks on the f-h files and ranks 1-3 and follow these moves: 1. Rh2 Rg2 2. Rgh3 Rg3 3. Rff2 Rhg1 4. Rh1 R1g2 5. Rg1 Rh2 6. Rfg2 Rff3 7. Rf2 Rhg2 8. Rhh1 Rh2 9. Rff1 Rhh3.
    $endgroup$
    – Rewan Demontay
    4 hours ago










  • $begingroup$
    It's white rooks on the first rank, black rooks on the third, and White to move first.
    $endgroup$
    – Rewan Demontay
    4 hours ago













7












7








7





$begingroup$


You have a 4x4 chessboard with four black rooks on the top and four white rooks in the bottom.



Your goal is to swap these rooks using the minimum number of steps. It does not matter which rook is which, as long as there are four white rooks on the top and four black rooks in the bottom.



enter image description here



Chess rules apply: rooks can move any number of squares, horizontally (left and right) or vertically (up and down), as long as there is not another piece on the way. White starts. You must alternate black and white moves.










share|improve this question











$endgroup$




You have a 4x4 chessboard with four black rooks on the top and four white rooks in the bottom.



Your goal is to swap these rooks using the minimum number of steps. It does not matter which rook is which, as long as there are four white rooks on the top and four black rooks in the bottom.



enter image description here



Chess rules apply: rooks can move any number of squares, horizontally (left and right) or vertically (up and down), as long as there is not another piece on the way. White starts. You must alternate black and white moves.







chess optimization






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited 8 hours ago







Chaotic

















asked 8 hours ago









ChaoticChaotic

661316




661316







  • 1




    $begingroup$
    This is the type of question which might make a good secondary puzzle along the lines of "how many steps does it take to swap rooks on an nxn board"! (+1)
    $endgroup$
    – Adam
    8 hours ago







  • 1




    $begingroup$
    Yes, I thought about that. In a 3x3 board I was able to do in 14 moves, but I'm not sure if it is the optimal solution. I also don't think it would be a good idea to open a new question for a 3x3, 5x5, 8x8, etc.
    $endgroup$
    – Chaotic
    8 hours ago










  • $begingroup$
    Not necessarily, but the generalization is a worthy question to ask, though perhaps not by itself not that you've asked the instance for n = 4. Still, I do believe this should generalize quite nicely.
    $endgroup$
    – greenturtle3141
    6 hours ago










  • $begingroup$
    I'm fairly sure that for a 3*3, 9 is optimal. Set up the rooks on the f-h files and ranks 1-3 and follow these moves: 1. Rh2 Rg2 2. Rgh3 Rg3 3. Rff2 Rhg1 4. Rh1 R1g2 5. Rg1 Rh2 6. Rfg2 Rff3 7. Rf2 Rhg2 8. Rhh1 Rh2 9. Rff1 Rhh3.
    $endgroup$
    – Rewan Demontay
    4 hours ago










  • $begingroup$
    It's white rooks on the first rank, black rooks on the third, and White to move first.
    $endgroup$
    – Rewan Demontay
    4 hours ago












  • 1




    $begingroup$
    This is the type of question which might make a good secondary puzzle along the lines of "how many steps does it take to swap rooks on an nxn board"! (+1)
    $endgroup$
    – Adam
    8 hours ago







  • 1




    $begingroup$
    Yes, I thought about that. In a 3x3 board I was able to do in 14 moves, but I'm not sure if it is the optimal solution. I also don't think it would be a good idea to open a new question for a 3x3, 5x5, 8x8, etc.
    $endgroup$
    – Chaotic
    8 hours ago










  • $begingroup$
    Not necessarily, but the generalization is a worthy question to ask, though perhaps not by itself not that you've asked the instance for n = 4. Still, I do believe this should generalize quite nicely.
    $endgroup$
    – greenturtle3141
    6 hours ago










  • $begingroup$
    I'm fairly sure that for a 3*3, 9 is optimal. Set up the rooks on the f-h files and ranks 1-3 and follow these moves: 1. Rh2 Rg2 2. Rgh3 Rg3 3. Rff2 Rhg1 4. Rh1 R1g2 5. Rg1 Rh2 6. Rfg2 Rff3 7. Rf2 Rhg2 8. Rhh1 Rh2 9. Rff1 Rhh3.
    $endgroup$
    – Rewan Demontay
    4 hours ago










  • $begingroup$
    It's white rooks on the first rank, black rooks on the third, and White to move first.
    $endgroup$
    – Rewan Demontay
    4 hours ago







1




1




$begingroup$
This is the type of question which might make a good secondary puzzle along the lines of "how many steps does it take to swap rooks on an nxn board"! (+1)
$endgroup$
– Adam
8 hours ago





$begingroup$
This is the type of question which might make a good secondary puzzle along the lines of "how many steps does it take to swap rooks on an nxn board"! (+1)
$endgroup$
– Adam
8 hours ago





1




1




$begingroup$
Yes, I thought about that. In a 3x3 board I was able to do in 14 moves, but I'm not sure if it is the optimal solution. I also don't think it would be a good idea to open a new question for a 3x3, 5x5, 8x8, etc.
$endgroup$
– Chaotic
8 hours ago




$begingroup$
Yes, I thought about that. In a 3x3 board I was able to do in 14 moves, but I'm not sure if it is the optimal solution. I also don't think it would be a good idea to open a new question for a 3x3, 5x5, 8x8, etc.
$endgroup$
– Chaotic
8 hours ago












$begingroup$
Not necessarily, but the generalization is a worthy question to ask, though perhaps not by itself not that you've asked the instance for n = 4. Still, I do believe this should generalize quite nicely.
$endgroup$
– greenturtle3141
6 hours ago




$begingroup$
Not necessarily, but the generalization is a worthy question to ask, though perhaps not by itself not that you've asked the instance for n = 4. Still, I do believe this should generalize quite nicely.
$endgroup$
– greenturtle3141
6 hours ago












$begingroup$
I'm fairly sure that for a 3*3, 9 is optimal. Set up the rooks on the f-h files and ranks 1-3 and follow these moves: 1. Rh2 Rg2 2. Rgh3 Rg3 3. Rff2 Rhg1 4. Rh1 R1g2 5. Rg1 Rh2 6. Rfg2 Rff3 7. Rf2 Rhg2 8. Rhh1 Rh2 9. Rff1 Rhh3.
$endgroup$
– Rewan Demontay
4 hours ago




$begingroup$
I'm fairly sure that for a 3*3, 9 is optimal. Set up the rooks on the f-h files and ranks 1-3 and follow these moves: 1. Rh2 Rg2 2. Rgh3 Rg3 3. Rff2 Rhg1 4. Rh1 R1g2 5. Rg1 Rh2 6. Rfg2 Rff3 7. Rf2 Rhg2 8. Rhh1 Rh2 9. Rff1 Rhh3.
$endgroup$
– Rewan Demontay
4 hours ago












$begingroup$
It's white rooks on the first rank, black rooks on the third, and White to move first.
$endgroup$
– Rewan Demontay
4 hours ago




$begingroup$
It's white rooks on the first rank, black rooks on the third, and White to move first.
$endgroup$
– Rewan Demontay
4 hours ago










4 Answers
4






active

oldest

votes


















3












$begingroup$

Got 19 by moving around... might be possible to do better:




1) a1-a3
2) d4-d2
3) b1-b3
4) d2-a2
5) d1-d4
6) a2-a1
7) c1-d1
8) c4-c1
9) b3-c3
10) b4-b1
11) a3-b3
12) a4-a2
13) d4-a4
14) a2-c2
15) d1-d4
16) c2-d2
17) b3-b4
18) d2-d1
19) c3-c4

enter image description here







share|improve this answer











$endgroup$




















    2












    $begingroup$

    Found a solution in 20, though I have no idea if it's optimal. One of my assumptions was that "Chess rules apply" meant I had to alternate black and white moves.




    enter image description here







    share|improve this answer









    $endgroup$












    • $begingroup$
      I have 2 that are different and 20 and I am not sure either.
      $endgroup$
      – Duck
      8 hours ago










    • $begingroup$
      Thanks, I've added the clarification.
      $endgroup$
      – Chaotic
      8 hours ago


















    1












    $begingroup$

    Found a 19 move solution, but no idea about optimum.




    a1-a3

    a3-d3

    b1-b2

    b2-d2

    a4-a1

    b4-b1

    c1-c2

    c2-a2

    a2-a4

    c4-c1

    d4-c4

    c4-c3

    d3-d4

    d4-b4

    d2-d4

    d4-c4

    d1-d4

    c3-d3

    d3-d1




    Where the columns are a, b, c, d and rows are 1, 2, 3, 4, starting from bottom left.






    share|improve this answer









    $endgroup$








    • 1




      $begingroup$
      OP made an edit - moves must alternate between White and Black.
      $endgroup$
      – shoopi
      7 hours ago



















    0












    $begingroup$

    EDIT: As @greenturtle pointed out in a comment, it seems that everyone else is doing the count by ply, and not the whole moves. The question is unclear to me about this on how the count is done. So thus my count is wrong by the majority's decision.



    As such, just for fun, here is a symmetrical solution of 20 moves that uses the same notations as my below answer.




    $1.$ Rh2 Rg3 $2.$ Rff2 Ree3 $3.$ Re2 Rh3 $4.$ Rg1 Rf4 $5.$ Rhf2 Reg3 $6.$ Rff1 Rgg4 $7.$ Ree1 Rhh4 $8.$ R4e2 R1h3 $9.$ Rh2 Re3 $10.$ Rhh1 Ree4




    I found a solution in 12 moves. Here is a link to a GIF using Apronus. I'm using an 8 x 8 board for convenience in the gif, but I'm treating it as 4 x 4.



    The following notation for my solution assumes that the files used are e through h and the ranks are 1 through 4, with the board being as it is from White's view on a normal chess board.



    My Solution:




    $1.$ Rg3 Rh2 $2.$ Rh3 Rhg2 $3.$ Rh4 Rg1 $4.$ R1h3 R4g2 $5.$ Rg3 Rh2 $6.$ Rgg4 Rhh1 $7.$ Re3 Rf2 $8.$ Rf3 Rfe2 $9.$ Rff4 Re1 $10.$ R1f3 R4e2 $11.$ Re3 Rf2 $12.$ Ree4 Rff1




    I'm fairly sure that this is optimal due to how each rook moves a minimum of three times.






    share|improve this answer











    $endgroup$












    • $begingroup$
      Seems like the metric everyone else has adopted is total number of rook moves, in which case you'd have 24. I think people are reducing this to 20 by cleverly getting some rooks to the other side in one move.
      $endgroup$
      – greenturtle3141
      4 hours ago










    • $begingroup$
      Oh. Well than the question should speifcy that the count is in ply, not in whole moves as I thought.
      $endgroup$
      – Rewan Demontay
      4 hours ago













    Your Answer








    StackExchange.ready(function()
    var channelOptions =
    tags: "".split(" "),
    id: "559"
    ;
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function()
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled)
    StackExchange.using("snippets", function()
    createEditor();
    );

    else
    createEditor();

    );

    function createEditor()
    StackExchange.prepareEditor(
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: false,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: null,
    bindNavPrevention: true,
    postfix: "",
    imageUploader:
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    ,
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    );



    );













    draft saved

    draft discarded


















    StackExchange.ready(
    function ()
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f85281%2fswapping-rooks-in-a-4x4-board%23new-answer', 'question_page');

    );

    Post as a guest















    Required, but never shown

























    4 Answers
    4






    active

    oldest

    votes








    4 Answers
    4






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    3












    $begingroup$

    Got 19 by moving around... might be possible to do better:




    1) a1-a3
    2) d4-d2
    3) b1-b3
    4) d2-a2
    5) d1-d4
    6) a2-a1
    7) c1-d1
    8) c4-c1
    9) b3-c3
    10) b4-b1
    11) a3-b3
    12) a4-a2
    13) d4-a4
    14) a2-c2
    15) d1-d4
    16) c2-d2
    17) b3-b4
    18) d2-d1
    19) c3-c4

    enter image description here







    share|improve this answer











    $endgroup$

















      3












      $begingroup$

      Got 19 by moving around... might be possible to do better:




      1) a1-a3
      2) d4-d2
      3) b1-b3
      4) d2-a2
      5) d1-d4
      6) a2-a1
      7) c1-d1
      8) c4-c1
      9) b3-c3
      10) b4-b1
      11) a3-b3
      12) a4-a2
      13) d4-a4
      14) a2-c2
      15) d1-d4
      16) c2-d2
      17) b3-b4
      18) d2-d1
      19) c3-c4

      enter image description here







      share|improve this answer











      $endgroup$















        3












        3








        3





        $begingroup$

        Got 19 by moving around... might be possible to do better:




        1) a1-a3
        2) d4-d2
        3) b1-b3
        4) d2-a2
        5) d1-d4
        6) a2-a1
        7) c1-d1
        8) c4-c1
        9) b3-c3
        10) b4-b1
        11) a3-b3
        12) a4-a2
        13) d4-a4
        14) a2-c2
        15) d1-d4
        16) c2-d2
        17) b3-b4
        18) d2-d1
        19) c3-c4

        enter image description here







        share|improve this answer











        $endgroup$



        Got 19 by moving around... might be possible to do better:




        1) a1-a3
        2) d4-d2
        3) b1-b3
        4) d2-a2
        5) d1-d4
        6) a2-a1
        7) c1-d1
        8) c4-c1
        9) b3-c3
        10) b4-b1
        11) a3-b3
        12) a4-a2
        13) d4-a4
        14) a2-c2
        15) d1-d4
        16) c2-d2
        17) b3-b4
        18) d2-d1
        19) c3-c4

        enter image description here








        share|improve this answer














        share|improve this answer



        share|improve this answer








        edited 6 hours ago

























        answered 6 hours ago









        shoopishoopi

        572411




        572411























            2












            $begingroup$

            Found a solution in 20, though I have no idea if it's optimal. One of my assumptions was that "Chess rules apply" meant I had to alternate black and white moves.




            enter image description here







            share|improve this answer









            $endgroup$












            • $begingroup$
              I have 2 that are different and 20 and I am not sure either.
              $endgroup$
              – Duck
              8 hours ago










            • $begingroup$
              Thanks, I've added the clarification.
              $endgroup$
              – Chaotic
              8 hours ago















            2












            $begingroup$

            Found a solution in 20, though I have no idea if it's optimal. One of my assumptions was that "Chess rules apply" meant I had to alternate black and white moves.




            enter image description here







            share|improve this answer









            $endgroup$












            • $begingroup$
              I have 2 that are different and 20 and I am not sure either.
              $endgroup$
              – Duck
              8 hours ago










            • $begingroup$
              Thanks, I've added the clarification.
              $endgroup$
              – Chaotic
              8 hours ago













            2












            2








            2





            $begingroup$

            Found a solution in 20, though I have no idea if it's optimal. One of my assumptions was that "Chess rules apply" meant I had to alternate black and white moves.




            enter image description here







            share|improve this answer









            $endgroup$



            Found a solution in 20, though I have no idea if it's optimal. One of my assumptions was that "Chess rules apply" meant I had to alternate black and white moves.




            enter image description here








            share|improve this answer












            share|improve this answer



            share|improve this answer










            answered 8 hours ago









            TedTed

            836




            836











            • $begingroup$
              I have 2 that are different and 20 and I am not sure either.
              $endgroup$
              – Duck
              8 hours ago










            • $begingroup$
              Thanks, I've added the clarification.
              $endgroup$
              – Chaotic
              8 hours ago
















            • $begingroup$
              I have 2 that are different and 20 and I am not sure either.
              $endgroup$
              – Duck
              8 hours ago










            • $begingroup$
              Thanks, I've added the clarification.
              $endgroup$
              – Chaotic
              8 hours ago















            $begingroup$
            I have 2 that are different and 20 and I am not sure either.
            $endgroup$
            – Duck
            8 hours ago




            $begingroup$
            I have 2 that are different and 20 and I am not sure either.
            $endgroup$
            – Duck
            8 hours ago












            $begingroup$
            Thanks, I've added the clarification.
            $endgroup$
            – Chaotic
            8 hours ago




            $begingroup$
            Thanks, I've added the clarification.
            $endgroup$
            – Chaotic
            8 hours ago











            1












            $begingroup$

            Found a 19 move solution, but no idea about optimum.




            a1-a3

            a3-d3

            b1-b2

            b2-d2

            a4-a1

            b4-b1

            c1-c2

            c2-a2

            a2-a4

            c4-c1

            d4-c4

            c4-c3

            d3-d4

            d4-b4

            d2-d4

            d4-c4

            d1-d4

            c3-d3

            d3-d1




            Where the columns are a, b, c, d and rows are 1, 2, 3, 4, starting from bottom left.






            share|improve this answer









            $endgroup$








            • 1




              $begingroup$
              OP made an edit - moves must alternate between White and Black.
              $endgroup$
              – shoopi
              7 hours ago
















            1












            $begingroup$

            Found a 19 move solution, but no idea about optimum.




            a1-a3

            a3-d3

            b1-b2

            b2-d2

            a4-a1

            b4-b1

            c1-c2

            c2-a2

            a2-a4

            c4-c1

            d4-c4

            c4-c3

            d3-d4

            d4-b4

            d2-d4

            d4-c4

            d1-d4

            c3-d3

            d3-d1




            Where the columns are a, b, c, d and rows are 1, 2, 3, 4, starting from bottom left.






            share|improve this answer









            $endgroup$








            • 1




              $begingroup$
              OP made an edit - moves must alternate between White and Black.
              $endgroup$
              – shoopi
              7 hours ago














            1












            1








            1





            $begingroup$

            Found a 19 move solution, but no idea about optimum.




            a1-a3

            a3-d3

            b1-b2

            b2-d2

            a4-a1

            b4-b1

            c1-c2

            c2-a2

            a2-a4

            c4-c1

            d4-c4

            c4-c3

            d3-d4

            d4-b4

            d2-d4

            d4-c4

            d1-d4

            c3-d3

            d3-d1




            Where the columns are a, b, c, d and rows are 1, 2, 3, 4, starting from bottom left.






            share|improve this answer









            $endgroup$



            Found a 19 move solution, but no idea about optimum.




            a1-a3

            a3-d3

            b1-b2

            b2-d2

            a4-a1

            b4-b1

            c1-c2

            c2-a2

            a2-a4

            c4-c1

            d4-c4

            c4-c3

            d3-d4

            d4-b4

            d2-d4

            d4-c4

            d1-d4

            c3-d3

            d3-d1




            Where the columns are a, b, c, d and rows are 1, 2, 3, 4, starting from bottom left.







            share|improve this answer












            share|improve this answer



            share|improve this answer










            answered 8 hours ago









            SteveVSteveV

            7,2182636




            7,2182636







            • 1




              $begingroup$
              OP made an edit - moves must alternate between White and Black.
              $endgroup$
              – shoopi
              7 hours ago













            • 1




              $begingroup$
              OP made an edit - moves must alternate between White and Black.
              $endgroup$
              – shoopi
              7 hours ago








            1




            1




            $begingroup$
            OP made an edit - moves must alternate between White and Black.
            $endgroup$
            – shoopi
            7 hours ago





            $begingroup$
            OP made an edit - moves must alternate between White and Black.
            $endgroup$
            – shoopi
            7 hours ago












            0












            $begingroup$

            EDIT: As @greenturtle pointed out in a comment, it seems that everyone else is doing the count by ply, and not the whole moves. The question is unclear to me about this on how the count is done. So thus my count is wrong by the majority's decision.



            As such, just for fun, here is a symmetrical solution of 20 moves that uses the same notations as my below answer.




            $1.$ Rh2 Rg3 $2.$ Rff2 Ree3 $3.$ Re2 Rh3 $4.$ Rg1 Rf4 $5.$ Rhf2 Reg3 $6.$ Rff1 Rgg4 $7.$ Ree1 Rhh4 $8.$ R4e2 R1h3 $9.$ Rh2 Re3 $10.$ Rhh1 Ree4




            I found a solution in 12 moves. Here is a link to a GIF using Apronus. I'm using an 8 x 8 board for convenience in the gif, but I'm treating it as 4 x 4.



            The following notation for my solution assumes that the files used are e through h and the ranks are 1 through 4, with the board being as it is from White's view on a normal chess board.



            My Solution:




            $1.$ Rg3 Rh2 $2.$ Rh3 Rhg2 $3.$ Rh4 Rg1 $4.$ R1h3 R4g2 $5.$ Rg3 Rh2 $6.$ Rgg4 Rhh1 $7.$ Re3 Rf2 $8.$ Rf3 Rfe2 $9.$ Rff4 Re1 $10.$ R1f3 R4e2 $11.$ Re3 Rf2 $12.$ Ree4 Rff1




            I'm fairly sure that this is optimal due to how each rook moves a minimum of three times.






            share|improve this answer











            $endgroup$












            • $begingroup$
              Seems like the metric everyone else has adopted is total number of rook moves, in which case you'd have 24. I think people are reducing this to 20 by cleverly getting some rooks to the other side in one move.
              $endgroup$
              – greenturtle3141
              4 hours ago










            • $begingroup$
              Oh. Well than the question should speifcy that the count is in ply, not in whole moves as I thought.
              $endgroup$
              – Rewan Demontay
              4 hours ago















            0












            $begingroup$

            EDIT: As @greenturtle pointed out in a comment, it seems that everyone else is doing the count by ply, and not the whole moves. The question is unclear to me about this on how the count is done. So thus my count is wrong by the majority's decision.



            As such, just for fun, here is a symmetrical solution of 20 moves that uses the same notations as my below answer.




            $1.$ Rh2 Rg3 $2.$ Rff2 Ree3 $3.$ Re2 Rh3 $4.$ Rg1 Rf4 $5.$ Rhf2 Reg3 $6.$ Rff1 Rgg4 $7.$ Ree1 Rhh4 $8.$ R4e2 R1h3 $9.$ Rh2 Re3 $10.$ Rhh1 Ree4




            I found a solution in 12 moves. Here is a link to a GIF using Apronus. I'm using an 8 x 8 board for convenience in the gif, but I'm treating it as 4 x 4.



            The following notation for my solution assumes that the files used are e through h and the ranks are 1 through 4, with the board being as it is from White's view on a normal chess board.



            My Solution:




            $1.$ Rg3 Rh2 $2.$ Rh3 Rhg2 $3.$ Rh4 Rg1 $4.$ R1h3 R4g2 $5.$ Rg3 Rh2 $6.$ Rgg4 Rhh1 $7.$ Re3 Rf2 $8.$ Rf3 Rfe2 $9.$ Rff4 Re1 $10.$ R1f3 R4e2 $11.$ Re3 Rf2 $12.$ Ree4 Rff1




            I'm fairly sure that this is optimal due to how each rook moves a minimum of three times.






            share|improve this answer











            $endgroup$












            • $begingroup$
              Seems like the metric everyone else has adopted is total number of rook moves, in which case you'd have 24. I think people are reducing this to 20 by cleverly getting some rooks to the other side in one move.
              $endgroup$
              – greenturtle3141
              4 hours ago










            • $begingroup$
              Oh. Well than the question should speifcy that the count is in ply, not in whole moves as I thought.
              $endgroup$
              – Rewan Demontay
              4 hours ago













            0












            0








            0





            $begingroup$

            EDIT: As @greenturtle pointed out in a comment, it seems that everyone else is doing the count by ply, and not the whole moves. The question is unclear to me about this on how the count is done. So thus my count is wrong by the majority's decision.



            As such, just for fun, here is a symmetrical solution of 20 moves that uses the same notations as my below answer.




            $1.$ Rh2 Rg3 $2.$ Rff2 Ree3 $3.$ Re2 Rh3 $4.$ Rg1 Rf4 $5.$ Rhf2 Reg3 $6.$ Rff1 Rgg4 $7.$ Ree1 Rhh4 $8.$ R4e2 R1h3 $9.$ Rh2 Re3 $10.$ Rhh1 Ree4




            I found a solution in 12 moves. Here is a link to a GIF using Apronus. I'm using an 8 x 8 board for convenience in the gif, but I'm treating it as 4 x 4.



            The following notation for my solution assumes that the files used are e through h and the ranks are 1 through 4, with the board being as it is from White's view on a normal chess board.



            My Solution:




            $1.$ Rg3 Rh2 $2.$ Rh3 Rhg2 $3.$ Rh4 Rg1 $4.$ R1h3 R4g2 $5.$ Rg3 Rh2 $6.$ Rgg4 Rhh1 $7.$ Re3 Rf2 $8.$ Rf3 Rfe2 $9.$ Rff4 Re1 $10.$ R1f3 R4e2 $11.$ Re3 Rf2 $12.$ Ree4 Rff1




            I'm fairly sure that this is optimal due to how each rook moves a minimum of three times.






            share|improve this answer











            $endgroup$



            EDIT: As @greenturtle pointed out in a comment, it seems that everyone else is doing the count by ply, and not the whole moves. The question is unclear to me about this on how the count is done. So thus my count is wrong by the majority's decision.



            As such, just for fun, here is a symmetrical solution of 20 moves that uses the same notations as my below answer.




            $1.$ Rh2 Rg3 $2.$ Rff2 Ree3 $3.$ Re2 Rh3 $4.$ Rg1 Rf4 $5.$ Rhf2 Reg3 $6.$ Rff1 Rgg4 $7.$ Ree1 Rhh4 $8.$ R4e2 R1h3 $9.$ Rh2 Re3 $10.$ Rhh1 Ree4




            I found a solution in 12 moves. Here is a link to a GIF using Apronus. I'm using an 8 x 8 board for convenience in the gif, but I'm treating it as 4 x 4.



            The following notation for my solution assumes that the files used are e through h and the ranks are 1 through 4, with the board being as it is from White's view on a normal chess board.



            My Solution:




            $1.$ Rg3 Rh2 $2.$ Rh3 Rhg2 $3.$ Rh4 Rg1 $4.$ R1h3 R4g2 $5.$ Rg3 Rh2 $6.$ Rgg4 Rhh1 $7.$ Re3 Rf2 $8.$ Rf3 Rfe2 $9.$ Rff4 Re1 $10.$ R1f3 R4e2 $11.$ Re3 Rf2 $12.$ Ree4 Rff1




            I'm fairly sure that this is optimal due to how each rook moves a minimum of three times.







            share|improve this answer














            share|improve this answer



            share|improve this answer








            edited 1 hour ago









            Duck

            1,371117




            1,371117










            answered 5 hours ago









            Rewan DemontayRewan Demontay

            1,292221




            1,292221











            • $begingroup$
              Seems like the metric everyone else has adopted is total number of rook moves, in which case you'd have 24. I think people are reducing this to 20 by cleverly getting some rooks to the other side in one move.
              $endgroup$
              – greenturtle3141
              4 hours ago










            • $begingroup$
              Oh. Well than the question should speifcy that the count is in ply, not in whole moves as I thought.
              $endgroup$
              – Rewan Demontay
              4 hours ago
















            • $begingroup$
              Seems like the metric everyone else has adopted is total number of rook moves, in which case you'd have 24. I think people are reducing this to 20 by cleverly getting some rooks to the other side in one move.
              $endgroup$
              – greenturtle3141
              4 hours ago










            • $begingroup$
              Oh. Well than the question should speifcy that the count is in ply, not in whole moves as I thought.
              $endgroup$
              – Rewan Demontay
              4 hours ago















            $begingroup$
            Seems like the metric everyone else has adopted is total number of rook moves, in which case you'd have 24. I think people are reducing this to 20 by cleverly getting some rooks to the other side in one move.
            $endgroup$
            – greenturtle3141
            4 hours ago




            $begingroup$
            Seems like the metric everyone else has adopted is total number of rook moves, in which case you'd have 24. I think people are reducing this to 20 by cleverly getting some rooks to the other side in one move.
            $endgroup$
            – greenturtle3141
            4 hours ago












            $begingroup$
            Oh. Well than the question should speifcy that the count is in ply, not in whole moves as I thought.
            $endgroup$
            – Rewan Demontay
            4 hours ago




            $begingroup$
            Oh. Well than the question should speifcy that the count is in ply, not in whole moves as I thought.
            $endgroup$
            – Rewan Demontay
            4 hours ago

















            draft saved

            draft discarded
















































            Thanks for contributing an answer to Puzzling Stack Exchange!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid


            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.

            Use MathJax to format equations. MathJax reference.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f85281%2fswapping-rooks-in-a-4x4-board%23new-answer', 'question_page');

            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            Popular posts from this blog

            ParseJSON using SSJSUsing AMPscript with SSJS ActivitiesHow to resubscribe a user in Marketing cloud using SSJS?Pulling Subscriber Status from Lists using SSJSRetrieving Emails using SSJSProblem in updating DE using SSJSUsing SSJS to send single email in Marketing CloudError adding EmailSendDefinition using SSJS

            Кампала Садржај Географија Географија Историја Становништво Привреда Партнерски градови Референце Спољашње везе Мени за навигацију0°11′ СГШ; 32°20′ ИГД / 0.18° СГШ; 32.34° ИГД / 0.18; 32.340°11′ СГШ; 32°20′ ИГД / 0.18° СГШ; 32.34° ИГД / 0.18; 32.34МедијиПодациЗванични веб-сајту

            19. јануар Садржај Догађаји Рођења Смрти Празници и дани сећања Види још Референце Мени за навигацијуу