Partition a square grid into parts of equal area












5












$begingroup$


This challenge is based on the following puzzle: You are given an n by n grid with n cells marked. Your job is to the partition the grid into n parts where each part consists of exactly n cells.



Example



Here is a puzzle on the left and its (unique) solution on the right:



puzzlesolution



Challenge



You will be given a set of n zero-indexed coordinates in any reasonable format.



[(0,0), (0,3), (1,0), (1,1), (2,2)]


And your job is to write a program that returns any valid parition (again, in any reasonable format).



[

  [(0,0), (0,1), (0,2), (1,2), (1,3)],

  [(0,3), (0,4), (1,4), (2,4), (3,4)],

  [(1,0), (2,0), (3,0), (4,0), (4,1)],

  [(1,1), (2,1), (3,1), (3,2), (4,2)],

  [(2,2), (2,3), (3,3), (4,3), (4,4)]

]


If the puzzle has no solution, the program should indicate that by throwing an error or returning an empty solution.



Input/Output Examples



[(0,0)]               => [[(0,0)]]



[(0,0), (1,1)]        => [

                          [(0,0), (1,0)], 

                          [(0,1), (1,1)]

                         ]



[(0,0), (0,1), (1,0)] =>  (no solution)



[(0,0), (0,1), (0,2)] => [

                          [(0,0), (1,0), (2,0)], 

                          [(0,1), (1,1), (2,1)],

                          [(0,2), (1,2), (2,2)],

                         ]



[(0,0), (0,2), (1,2)] => [

                          [(0,0), (1,0), (2,0)], 

                          [(0,1), (0,2), (1,1)],

                          [(1,2), (2,1), (2,2)],

                         ]


Scoring



This is code-golf, so shortest code wins.






code-golf combinatorics grid set-partitions







share|improve this question









$endgroup$












  • $begingroup$
    This was inspired by this Math Stack Exchange question.
    $endgroup$
    – Peter Kagey
    5 hours ago










  • $begingroup$
    @Arnauld, it looks like for Shikaku puzzles, "the objective is to divide the grid into rectangular and square pieces". In this case, there is no such constraint.
    $endgroup$
    – Peter Kagey
    5 hours ago










  • $begingroup$
    Sorry for the confusion. I think there might be a Shikaku challenge somewhere in the sandbox, or maybe I was planning to make one myself at some point -- I can't remember for sure. Either way, I thought it was the same thing at first glance.
    $endgroup$
    – Arnauld
    5 hours ago
















5












$begingroup$


This challenge is based on the following puzzle: You are given an n by n grid with n cells marked. Your job is to the partition the grid into n parts where each part consists of exactly n cells.



Example



Here is a puzzle on the left and its (unique) solution on the right:



puzzlesolution



Challenge



You will be given a set of n zero-indexed coordinates in any reasonable format.



[(0,0), (0,3), (1,0), (1,1), (2,2)]


And your job is to write a program that returns any valid parition (again, in any reasonable format).



[

  [(0,0), (0,1), (0,2), (1,2), (1,3)],

  [(0,3), (0,4), (1,4), (2,4), (3,4)],

  [(1,0), (2,0), (3,0), (4,0), (4,1)],

  [(1,1), (2,1), (3,1), (3,2), (4,2)],

  [(2,2), (2,3), (3,3), (4,3), (4,4)]

]


If the puzzle has no solution, the program should indicate that by throwing an error or returning an empty solution.



Input/Output Examples



[(0,0)]               => [[(0,0)]]



[(0,0), (1,1)]        => [

                          [(0,0), (1,0)], 

                          [(0,1), (1,1)]

                         ]



[(0,0), (0,1), (1,0)] =>  (no solution)



[(0,0), (0,1), (0,2)] => [

                          [(0,0), (1,0), (2,0)], 

                          [(0,1), (1,1), (2,1)],

                          [(0,2), (1,2), (2,2)],

                         ]



[(0,0), (0,2), (1,2)] => [

                          [(0,0), (1,0), (2,0)], 

                          [(0,1), (0,2), (1,1)],

                          [(1,2), (2,1), (2,2)],

                         ]


Scoring



This is code-golf, so shortest code wins.






code-golf combinatorics grid set-partitions







share|improve this question









$endgroup$












  • $begingroup$
    This was inspired by this Math Stack Exchange question.
    $endgroup$
    – Peter Kagey
    5 hours ago










  • $begingroup$
    @Arnauld, it looks like for Shikaku puzzles, "the objective is to divide the grid into rectangular and square pieces". In this case, there is no such constraint.
    $endgroup$
    – Peter Kagey
    5 hours ago










  • $begingroup$
    Sorry for the confusion. I think there might be a Shikaku challenge somewhere in the sandbox, or maybe I was planning to make one myself at some point -- I can't remember for sure. Either way, I thought it was the same thing at first glance.
    $endgroup$
    – Arnauld
    5 hours ago














5












5








5


1



$begingroup$


This challenge is based on the following puzzle: You are given an n by n grid with n cells marked. Your job is to the partition the grid into n parts where each part consists of exactly n cells.



Example



Here is a puzzle on the left and its (unique) solution on the right:



puzzlesolution



Challenge



You will be given a set of n zero-indexed coordinates in any reasonable format.



[(0,0), (0,3), (1,0), (1,1), (2,2)]


And your job is to write a program that returns any valid parition (again, in any reasonable format).



[

  [(0,0), (0,1), (0,2), (1,2), (1,3)],

  [(0,3), (0,4), (1,4), (2,4), (3,4)],

  [(1,0), (2,0), (3,0), (4,0), (4,1)],

  [(1,1), (2,1), (3,1), (3,2), (4,2)],

  [(2,2), (2,3), (3,3), (4,3), (4,4)]

]


If the puzzle has no solution, the program should indicate that by throwing an error or returning an empty solution.



Input/Output Examples



[(0,0)]               => [[(0,0)]]



[(0,0), (1,1)]        => [

                          [(0,0), (1,0)], 

                          [(0,1), (1,1)]

                         ]



[(0,0), (0,1), (1,0)] =>  (no solution)



[(0,0), (0,1), (0,2)] => [

                          [(0,0), (1,0), (2,0)], 

                          [(0,1), (1,1), (2,1)],

                          [(0,2), (1,2), (2,2)],

                         ]



[(0,0), (0,2), (1,2)] => [

                          [(0,0), (1,0), (2,0)], 

                          [(0,1), (0,2), (1,1)],

                          [(1,2), (2,1), (2,2)],

                         ]


Scoring



This is code-golf, so shortest code wins.






code-golf combinatorics grid set-partitions







share|improve this question









$endgroup$




This challenge is based on the following puzzle: You are given an n by n grid with n cells marked. Your job is to the partition the grid into n parts where each part consists of exactly n cells.



Example



Here is a puzzle on the left and its (unique) solution on the right:



puzzlesolution



Challenge



You will be given a set of n zero-indexed coordinates in any reasonable format.



[(0,0), (0,3), (1,0), (1,1), (2,2)]


And your job is to write a program that returns any valid parition (again, in any reasonable format).



[

  [(0,0), (0,1), (0,2), (1,2), (1,3)],

  [(0,3), (0,4), (1,4), (2,4), (3,4)],

  [(1,0), (2,0), (3,0), (4,0), (4,1)],

  [(1,1), (2,1), (3,1), (3,2), (4,2)],

  [(2,2), (2,3), (3,3), (4,3), (4,4)]

]


If the puzzle has no solution, the program should indicate that by throwing an error or returning an empty solution.



Input/Output Examples



[(0,0)]               => [[(0,0)]]



[(0,0), (1,1)]        => [

                          [(0,0), (1,0)], 

                          [(0,1), (1,1)]

                         ]



[(0,0), (0,1), (1,0)] =>  (no solution)



[(0,0), (0,1), (0,2)] => [

                          [(0,0), (1,0), (2,0)], 

                          [(0,1), (1,1), (2,1)],

                          [(0,2), (1,2), (2,2)],

                         ]



[(0,0), (0,2), (1,2)] => [

                          [(0,0), (1,0), (2,0)], 

                          [(0,1), (0,2), (1,1)],

                          [(1,2), (2,1), (2,2)],

                         ]


Scoring



This is code-golf, so shortest code wins.






code-golf combinatorics grid set-partitions




code-golf combinatorics grid set-partitions






share|improve this question













share|improve this question











share|improve this question




share|improve this question










asked 5 hours ago









Peter KageyPeter Kagey

773517




773517












  • $begingroup$
    This was inspired by this Math Stack Exchange question.
    $endgroup$
    – Peter Kagey
    5 hours ago










  • $begingroup$
    @Arnauld, it looks like for Shikaku puzzles, "the objective is to divide the grid into rectangular and square pieces". In this case, there is no such constraint.
    $endgroup$
    – Peter Kagey
    5 hours ago










  • $begingroup$
    Sorry for the confusion. I think there might be a Shikaku challenge somewhere in the sandbox, or maybe I was planning to make one myself at some point -- I can't remember for sure. Either way, I thought it was the same thing at first glance.
    $endgroup$
    – Arnauld
    5 hours ago


















  • $begingroup$
    This was inspired by this Math Stack Exchange question.
    $endgroup$
    – Peter Kagey
    5 hours ago










  • $begingroup$
    @Arnauld, it looks like for Shikaku puzzles, "the objective is to divide the grid into rectangular and square pieces". In this case, there is no such constraint.
    $endgroup$
    – Peter Kagey
    5 hours ago










  • $begingroup$
    Sorry for the confusion. I think there might be a Shikaku challenge somewhere in the sandbox, or maybe I was planning to make one myself at some point -- I can't remember for sure. Either way, I thought it was the same thing at first glance.
    $endgroup$
    – Arnauld
    5 hours ago
















$begingroup$
This was inspired by this Math Stack Exchange question.
$endgroup$
– Peter Kagey
5 hours ago




$begingroup$
This was inspired by this Math Stack Exchange question.
$endgroup$
– Peter Kagey
5 hours ago












$begingroup$
@Arnauld, it looks like for Shikaku puzzles, "the objective is to divide the grid into rectangular and square pieces". In this case, there is no such constraint.
$endgroup$
– Peter Kagey
5 hours ago




$begingroup$
@Arnauld, it looks like for Shikaku puzzles, "the objective is to divide the grid into rectangular and square pieces". In this case, there is no such constraint.
$endgroup$
– Peter Kagey
5 hours ago












$begingroup$
Sorry for the confusion. I think there might be a Shikaku challenge somewhere in the sandbox, or maybe I was planning to make one myself at some point -- I can't remember for sure. Either way, I thought it was the same thing at first glance.
$endgroup$
– Arnauld
5 hours ago




$begingroup$
Sorry for the confusion. I think there might be a Shikaku challenge somewhere in the sandbox, or maybe I was planning to make one myself at some point -- I can't remember for sure. Either way, I thought it was the same thing at first glance.
$endgroup$
– Arnauld
5 hours ago










1 Answer
1






active

oldest

votes


















3












$begingroup$

JavaScript (ES6), 163 bytes



Prints all possible solutions as matrices containing 1-indexed values that describe the partition. (Or prints nothing if there's no solution.)





a=>(m=a.map(_=>[...a]),g=(n,[X,Y]=a[n++],j=0)=>a[j]?m.map((r,y)=>r.map((v,x)=>++v|(X-x)**2+(Y-y)**2-!!j?0:r[g(r[x]=n,[x,y],j+1),x]=v)):a[n]?g(n):console.log(m))(0)


Try it online!






share|improve this answer









$endgroup$













    Your Answer





    StackExchange.ifUsing("editor", function () {
    return StackExchange.using("mathjaxEditing", function () {
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
    });
    });
    }, "mathjax-editing");

    StackExchange.ifUsing("editor", function () {
    StackExchange.using("externalEditor", function () {
    StackExchange.using("snippets", function () {
    StackExchange.snippets.init();
    });
    });
    }, "code-snippets");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "200"
    };
    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
    },
    onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f179074%2fpartition-a-square-grid-into-parts-of-equal-area%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    3












    $begingroup$

    JavaScript (ES6), 163 bytes



    Prints all possible solutions as matrices containing 1-indexed values that describe the partition. (Or prints nothing if there's no solution.)





    a=>(m=a.map(_=>[...a]),g=(n,[X,Y]=a[n++],j=0)=>a[j]?m.map((r,y)=>r.map((v,x)=>++v|(X-x)**2+(Y-y)**2-!!j?0:r[g(r[x]=n,[x,y],j+1),x]=v)):a[n]?g(n):console.log(m))(0)


    Try it online!






    share|improve this answer









    $endgroup$


















      3












      $begingroup$

      JavaScript (ES6), 163 bytes



      Prints all possible solutions as matrices containing 1-indexed values that describe the partition. (Or prints nothing if there's no solution.)





      a=>(m=a.map(_=>[...a]),g=(n,[X,Y]=a[n++],j=0)=>a[j]?m.map((r,y)=>r.map((v,x)=>++v|(X-x)**2+(Y-y)**2-!!j?0:r[g(r[x]=n,[x,y],j+1),x]=v)):a[n]?g(n):console.log(m))(0)


      Try it online!






      share|improve this answer









      $endgroup$
















        3












        3








        3





        $begingroup$

        JavaScript (ES6), 163 bytes



        Prints all possible solutions as matrices containing 1-indexed values that describe the partition. (Or prints nothing if there's no solution.)





        a=>(m=a.map(_=>[...a]),g=(n,[X,Y]=a[n++],j=0)=>a[j]?m.map((r,y)=>r.map((v,x)=>++v|(X-x)**2+(Y-y)**2-!!j?0:r[g(r[x]=n,[x,y],j+1),x]=v)):a[n]?g(n):console.log(m))(0)


        Try it online!






        share|improve this answer









        $endgroup$



        JavaScript (ES6), 163 bytes



        Prints all possible solutions as matrices containing 1-indexed values that describe the partition. (Or prints nothing if there's no solution.)





        a=>(m=a.map(_=>[...a]),g=(n,[X,Y]=a[n++],j=0)=>a[j]?m.map((r,y)=>r.map((v,x)=>++v|(X-x)**2+(Y-y)**2-!!j?0:r[g(r[x]=n,[x,y],j+1),x]=v)):a[n]?g(n):console.log(m))(0)


        Try it online!







        share|improve this answer












        share|improve this answer



        share|improve this answer










        answered 4 hours ago









        ArnauldArnauld

        73.9k690310




        73.9k690310






























            draft saved

            draft discarded




















































            If this is an answer to a challenge…




            • …Be sure to follow the challenge specification. However, please refrain from exploiting obvious loopholes. Answers abusing any of the standard loopholes are considered invalid. If you think a specification is unclear or underspecified, comment on the question instead.


            • …Try to optimize your score. For instance, answers to code-golf challenges should attempt to be as short as possible. You can always include a readable version of the code in addition to the competitive one.
              Explanations of your answer make it more interesting to read and are very much encouraged.


            • …Include a short header which indicates the language(s) of your code and its score, as defined by the challenge.



            More generally…




            • …Please make sure to answer the question and provide sufficient detail.


            • …Avoid asking for help, clarification or responding to other answers (use comments instead).





            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f179074%2fpartition-a-square-grid-into-parts-of-equal-area%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

            Сан-Квентин

            Image
            Сан-Квентин Местоположение Сан-Квентин, Калифорния Координаты 37°56′13″ с. ш. 122°29′20″ з. д. H G Я O L Текущий статус Действует Режим безопасности минимальный и максимальный Количество мест 3 302 Открытие Июнь 1852 Находится в ведомстве California Department of Corrections and Rehabilitation Начальник Mike Martel, начальник  Сан-Квентин на Викискладе Сан-Квентин (англ.  San Quentin ) — тюрьма, располагающаяся на 432 акрах (около 1,7 км²), на мысе Сан-Квентин, в округе Марин, штат Калифорния, США. Тюрьма штата Калифорния Сан-Квентин была открыта в июле 1852 года и является старейшей в штате. Она была построена заключёнными, которые проживали в течение строительства на тюремном судне Вабан. В Сан-Квентине отбывали наказание и мужчины, и женщины до 1934 года, когда построили женскую тюрьму в Техачапи и туда перевели всех заключённых женщин. В Сан-Квентине приводятся в исполнение смертные казни, для этого имеется газовая камера, но...
            Read more

            8-я гвардейская общевойсковая армия

            Image
            8-я гвардейская общевойсковая ордена Ленина армия Награды: Войска: РККА → Советская армия → СВ России Род войск: Формирование: 1943 Расформирование (преобразование): 1992 Предшественник: 62-я армия (1942—43) → 8-я гвардейская общевойсковая армия (1943—92) → 8-й гвардейский армейский корпус (1992—98) Боевой путь Изюм-Барвенковская операция Донбасская операция Запорожская операция Битва за Днепр Днепропетровская операция Березнеговато-Снигирёвская операция Одесская операция Люблин-Брестская операция Варшавско-Познанская операция Восточно-Померанская операция Берлинская наступательная операция У этого термина существуют и другие значения, см. 8-я армия. Фотография Гвардейского Красного Знамени (лицевая сторона) 8-й гвардейской армии , образца 1943 года. Фотография Гвардейского Красного Знамени (оборотная сторона) 8-й гвардейской армии , образца 1943 года. 8-я гвардейская общевойсковая ордена Ленина армия  — гвардейское фор...
            Read more

            Алькесар

            Image
            Муниципалитет Алькесар Alquézar Герб 42°10′16″ с. ш. 0°01′27″ в. д. H G Я O L Страна Испания   Испания Автономное сообщество Арагон Провинция Уэска Комарка Сомонтано-де-Барбастро Алькальд Хосе Марияно Альтемир Ласкорс (ИСРП) История и география Площадь 32,36 км² Высота НУМ 660 м Часовой пояс UTC+1, летом UTC+2 Население Население 313 человек ( 2010 ) Плотность 9,92 чел./км² Этнохороним alquezarano/-a Цифровые идентификаторы Телефонный код +34 974 Почтовые индексы 22112 Автомобильный код HU alquezar.org   (исп.) Показать/скрыть карты Алькесар Алькесар Алькесар  Аудио, фото и видео на Викискладе Алькесар (исп.  Alquézar ) — муниципалитет в Испании, входит в провинцию Уэска, в составе автономного сообщества Арагон. Муниципалитет находится в составе района (комарки) Сомонтано-де-Барбастро. Занимает площадь 32,36 км². Население — 321 челове...
            Read more