Đã Đóng

Find solution to simple problem using any programming language

I have an NxM grid there are two chess pieces one is 'Knight' and another is 'Bishop' which has different moving abilities. As we all know 'Knight' can move 2.5 steps and a 'Bishop' can move only diagonal but not horizontally or vertically. Some grids are inactive(Occupied by other chess pieces). I wanted to Return 1 position where the knight and bishop can attack.

For example: We have an 8*8 grid. 0,3 & 2,0 are inactive grids(I mean occupied by other pieces). 'Bishop' is at 3,2 position and possible direction are represented as arrow and 'Knight' is available at 6,6 and possible direction where knight can move are represented as arrow and circles. One of the possible point where the Bishop and Knight can meet is 4,5 as represented by yellow color. The reference image is attached.

Kĩ năng: JavaScript, Lập trình C++, Python, Combinatorial Problem Solving, Java

Xem nhiều hơn: point sale solution software programming language, business process outsourcing problem using linear programming, find programming job using softwareag natural programming language, read oracle databse using spss programming language, find roots equation polynomial equation using programming, find prime program using assembly language, simple projects programming language, solving graph coloring problem using genetic programming code, simple programming language voice recognition, programming project student design develop test document approach programming language solve specific problem issue computer inf, solution water jug problem using breadth search, programming gps gsm integration using embedded language, analytical thinking find simple solution complex problem, example analytical thinking find simple solution complex problem, php web programming language several different versions, the best way to find biggest square in c programming language, simple games using assembly language 8086, simple games using assembly language, which programming language should i learn first as a beginner

Về Bên Thuê:
( 4 nhận xét ) Palani, India

ID dự án: #30098772

9 freelancer chào giá trung bình₹1172 cho công việc này

arc9693

Hi there! I am an experienced C/C++/Python/Java programmer and an expert in data structures and algorithms. I believe i can help you and deliver your project at the earliest. Message me so that we can proceed further.

₹1500 INR trong 1 ngày
(22 Nhận xét)
4.4
shubha360

Hi there! I have had a good read in the problem description. The algorithm I came up with is, first, the knight should be moved towards the bishop as near as possible. Than the bishop should moved to the place where kn Thêm

₹1250 INR trong 1 ngày
(1 Nhận xét)
1.2
justin739

I am a competitive programmer (proficient in C++) with good problem solving skills (currently, a 6 star, 2248 rated on CodeChef, ranked 933 worldwide).

₹1050 INR trong 1 ngày
(0 Nhận xét)
0.0
vaibhav951364

I have been a competitive programmer (CodeChef and HackerRank) and I am pretty much sure that I have solved this problem earlier, I can tell you the solution in C++.

₹1050 INR trong 7 ngày
(0 Nhận xét)
0.0
seharn302

Do you need an expert in one of them language that can do your work? Yes i do this because i have 2 years experienced in making projects. I'm do this project in c++ language. if You are interested then contact me. than Thêm

₹1050 INR trong 7 ngày
(0 Nhận xét)
0.0
Rodonto

Hib, I am a CS graduate. I can write you this code in a simple and efficient way. Kindly message me to give away the project.

₹1250 INR trong 1 ngày
(1 Nhận xét)
0.8
Hemal1999

I have understood this problem quite clearly and already came up with a solution in my mind which i can explain you very effectively. I have excellent programming and logical skills, i have achieved an all India rank o Thêm

₹1100 INR trong 1 ngày
(0 Nhận xét)
0.0
bickrombishsass

Good at programming. Student from IIT. I think this is a dynamic programming/recursion question. I am pretty sure I can solve this.

₹1200 INR trong 2 ngày
(0 Nhận xét)
0.0
VyshnaviSindhe

I have already completed this question and solution is ready with me. Using java I have completed this question. A 'Horse' can move 2.5 steps and a 'Bishop' can move only diagonal but not horizontally or vertically. So Thêm

₹1100 INR trong 1 ngày
(0 Nhận xét)
0.0