Re: Let's play a game, pals.

[TheQuirk]

I figured that no one cared for this thread. It seems that I was incorrect. Next challenge:

Fill an n by n array in the following manner:



For example, suppose that n = 3. Your program should create the following array:

[[1 2 3]
 [8 9 4]
 [7 6 5]]

[solemnwarning]

Code: [Select]

#!/usr/bin/perl

print "n? ";
$n = ;
chomp($n);

if($n == "3") {
  open(TEMP, ">/tmp/array");
  print TEMP "1 2 3\n";
  print TEMP "8 9 4\n";
  print TEMP "7 6 5";
  close(TEMP);
  open(TEMP, "  @array = ;
  close(TEMP);
}

#The array is @array
is this what you mean?

[KernelPanic]

is this what you mean?

 :rolleyes:

[worker201]

for any positive integer x,

x + (x+1) = (x+1)^2 - x^2

example:
6 + 7 = 49 - 36

try it, it works.

I made this up all by myself.

[worker201]

I don't understand how to navigate through the square maze

Making an array is easy enough, I guess.  But I don't see the pattern in the circular motion.

[Laukev7]

It's simple, worker201.

 

Code: [Select]

1 -> 2 -> 3
    |
    V
 8 -> 9 4
 ^ |
  | V
 7 <- 6 <- 5
 

 or for n=4

 

Code: [Select]

1 -> 2 -> 3 -> 4
  |
    V
12-> 13-> 14       5
  ^  | |
  | V V
 11       16<- 15       6
 ^  |
  |  V
 10<- 9 <- 8 <- 7


[worker201]

That's even more confusing (an ascii art issue)

[Laukev7]

Fuck.

illhostit.com - sq3.bmp

[worker201]

Oh, ok.  I kinda get it now.

Nobody post an answer to this, because I want to take a couple days to figure it out.

[KernelPanic]

Oh, ok.  I kinda get it now.

Nobody post an answer to this, because I want to take a couple days to figure it out.

Yes, me too.

[worker201]

learning a language to create and populate the arrays looks like the tricky part...

[Pathos]

It shouldn't take longer than 2 mins to work out the strategy to do it.
It can be very tricky so just set small goals that show your strategy is working.

Think Recursively... What it being repeated?
Then you just need to work out the base steps and how to implement the recursion.

I didn't use an actual 2d dimensional array, I simulated one with a 1d array (n*n) if that helps.

[solemnwarning]

i already posted answer

[muzzy]

oh c'mon. there are lots of trivial solutions to this spiral thing. you can just write code to do it the way you'd do it on paper.

i suppose i could write a solution for you, but i don't want to spoil the fun if you want to solve it on your own

also, recursion isn't the best approach imo, i'd go for a simple state machine with iteration.

[KernelPanic]

This is very kludgy, and done in bash. (Doesn't format the results properly)
Please don't laugh!  :rolleyes:


When I finish my degree I will be better.
Honest.

[verwijderd door de beheerder]