Number of ways to fill a n*m piece matrix with L-shaped three piece tiles

Question

1.00/5 (1 vote)

See more:

I'm looking for an approach to this problem where you have to fill a NxM (N!=M) piece matrix with L-shaped three piece tiles. More accurate to say it s that every element of the matrix is a square and with an L-shaped i cover 3 elements .  [EXEMPLE][1]
I would like a full solve if possible . (C/C++/PYTHON)


  [1]: https://i.stack.imgur.com/gCC7h.png

What I have tried:

i created a matrix with N*M size , filled it with value 0 and then when a L-shaped piece is placed to change the values of the matrix to 0

Posted 27-Aug-20 7:11am

Member 14924606

Updated 27-Aug-20 14:10pm

Add a Solution

Comments

F-ES Sitecore 27-Aug-20 13:32pm

If you're looking for someone to write code for you try a freelancer website.

Patrice T 27-Aug-20 13:36pm

What have you done, what is the problem ?

Member 14924606 27-Aug-20 13:47pm

i can t find out how to continue solving

jeron1 27-Aug-20 13:49pm

Can you solve it on a piece paper?
Have you written any code?

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Sandeep Mewara · Answer 1 · 2020-08-27T09:14:00

I see you have posted this same query in atleast three forums.

By now you know its a broad topic and since you are asking for some direction to start in comments here (and at SO), take a cue from this: combinatorics - How many ways can you tile an NxM rectangle with L-polyominos? - Mathematics Stack Exchange[^]

Try out.

Rick York · Answer 2 · 2020-08-27T14:10:00

I would write numbers in the squares to indicate which shape it is part of with zero being empty. The first shape will be number one, the second will be two, and so on. The part I am uncertain of how do you distinguish between attempts? One possibility is too have a second variable for each square that indicates the orientation of the shape in it for the corner piece of the L. Since each one can have four possibilities that defines the number of possible options. Some combinations will be impossible because the square is already occupied by a different object and can't be a corner piece.

With three-piece shapes it is really rather simple. For a challenge - try it with four piece shapes.

Number of ways to fill a n*m piece matrix with L-shaped three piece tiles

2 solutions

Solution 1

Solution 2

Add your solution here

Preview 0