Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read
Challenges

Connect the corners without 4 in a row

+0
−0

Connect opposite corners of a rectangle of characters without putting 4 characters in a row.

Input

  • Two numbers, W and H, representing the width and height of the rectangle
  • Each number will be in the range 2 to 70

Output

  • A rectangular grid of characters, of width W and height H
  • You may choose any 2 distinct characters to represent path and background
  • The output must contain 2 connected path characters in diagonally opposite corners of the grid
    • Connected means there is a path from one to the other moving only between adjacent path characters
    • Adjacent means 1 character away horizontally or vertically (but not both - diagonal adjacency does not count as connection for this challenge)
  • The output must not contain 4 adjacent path characters in a line horizontally or vertically
  • There is no limit to how many of the characters may be path characters, provided there are never 4 in a row.
    • There may be redundant sections connected to the path
    • There may be disconnected sections of path provided the main path meets the requirements

Examples

These examples use # for a path character and . for the background.

Valid examples for input 4, 3

##..
.##.
..##

.###
.#..
##..

#...
##..
.###

##.#
.###
##.#

Invalid examples for input 4, 3

4 in a line horizontally:

#...
####
...#

Depends on diagonal adjacency, which does not count as connection:

#...
.#..
..##

Does not connect diagonally opposite corners:
###.
..##
###.

Valid examples for input 7, 5

###....
..#....
..###..
....#..
....###

##.....
.##....
..##...
...##..
....###

#......
#......
##.###.
.#.#.##
.###..#

###....
..###..
###.###
#...#.#
###...#

Invalid examples for input 7, 5

Does not connect two diagonally opposite corners:

###....
..###..
....###
...##..
...#...

Has 4 in a row horizontally:

####...
...#...
...###.
.....#.
.....##

Has 4 in a row vertically:

###....
..#....
..#.###
..###.#
......#

Depends on diagonal adjacency, which does not count as connection:

##.....
..##...
....##.
......#
......#

Validator

You can check a specific output using this path validator, which will give a reason for any failed validations.

Explanations are optional, but I'm more likely to upvote answers that have one.

Why does this post require moderator attention?
You might want to add some details to your flag.
Why should this post be closed?

0 comment threads

0 answers

Sign up to answer this question »

This community is part of the Codidact network. We have other communities too — take a look!

You can also join us in chat!

Want to advertise this community? Use our templates!

Like what we're doing? Support us! Donate