..Code: Select all
#!/usr/bin/perl
use strict;
use warnings;
#Benoetigte Variablen:
my @levelinfo;
my ($tempstring, $pfad);
my $i;
&website_auslesen("");
$i = 0;
$levelinfo[3] += 2;
$levelinfo[4] += 2;
$tempstring = "X"x$levelinfo[3];
for (1..($levelinfo[4]-2)){
$tempstring .= "X".substr($levelinfo[0], $i, $levelinfo[3]-2)."L";
$i += $levelinfo[3] - 2;
}
$tempstring .= "X"."L"x($levelinfo[3]-2)."X";
$levelinfo[0] = $tempstring;
$i = $levelinfo[2];
do{
print "$i\n";
$pfad = "."x$i;
$tempstring = &bruteforce($pfad);
$i++;
}while($tempstring eq "falsch");
print "$tempstring\n";
sub bruteforce{
my $tempstring;
my $pfad = $_[0];
my $i = index($pfad, "\.");
if($i > -1){
substr($pfad, $i, 1) = "R";
$tempstring = &bruteforce($pfad);
}else{
$tempstring = &verifizieren($pfad);
if($tempstring eq "falsch"){return $tempstring;}
else{return $pfad;}
}
if($tempstring ne "falsch"){return $tempstring;}
else{
substr($pfad, $i, 1) = "D";
$tempstring = &bruteforce($pfad);
return $tempstring;
}
}
sub verifizieren{
my ($mom_x, $mom_y) = (1, 1);
my $zaehler = -1;
do{
$zaehler++;
if($zaehler == length($pfad)){$zaehler = 0;}
if(substr($_[0], $zaehler, 1) eq "R"){$mom_x++;}
elsif(substr($_[0], $zaehler, 1) eq "D"){$mom_y++;}
}while(substr($levelinfo[0], $mom_y*$levelinfo[3]+$mom_x, 1) eq ".");
if(substr($levelinfo[0], $mom_y*$levelinfo[3]+$mom_x, 1) eq "X"){return "falsch";}
else{return "richtig";}
}
sub website_auslesen {
use LWP::Simple; #Packet, um den HTML-Inhalt auszulesen, initialisieren
my $htmlinhalt = get("http://www.hacker.org/runaway/index.php?name=YOURNAME&password=YOURPASSWORD")
|| die "KANN WEBSITE NICHT OEFFNEN"; #auslesen des HTML-Inhaltes
my $zahl = index($htmlinhalt, "FVterrainString=");
my $zahl2 = index($htmlinhalt, "\"", $zahl) - $zahl;
$htmlinhalt = substr($htmlinhalt, index($htmlinhalt, "FVterrainString="), $zahl2);
@levelinfo = split("&", $htmlinhalt);
foreach $zahl (0..$#levelinfo) {
$levelinfo[$zahl] = substr($levelinfo[$zahl], (index($levelinfo[$zahl], "=") + 1));
}
}Code: Select all
; solve by trial and error (backtracking)
(define (solve playfield w h minlen maxlen)
(define (fail? solution full-solution x y)
(cond ((null? solution)
(fail? full-solution full-solution x y))
((or (>= x w) (>= y h)) #f) ; win
((vector-ref (vector-ref playfield y) x) #t) ; sucks
((= (car solution) 1) ; 1 = D
(fail? (cdr solution) full-solution x (+ y 1)))
(else ; 0 = 'R
(fail? (cdr solution) full-solution (+ x 1) y))))
(define (solve-iter solution n)
(let ((rev (reverse solution)))
(cond ((and (>= n minlen)
(not (fail? rev rev 0 0))) rev)
((< n maxlen)
(or (solve-iter (cons 0 solution) (+ n 1))
(solve-iter (cons 1 solution) (+ n 1))))
(else #f))))
(or (solve-iter '(0) 1) (solve-iter '(1) 1)))
Actually... that's a FABULOUS idea! If some nasty Schemeish thing pops to my head in near future I'll mail it to adum. Thanks.megabreit wrote:Please don't "inspire" adum to introduce another programming language into the challenge arena.
The "boiling point" was Ada... but Scheme would be even stranger... it looks a bit like Lisp but with less brackets...
I mean... nothing against Scheme... it might perfectly fit your needs... but I simply won't see ANY programming language in the challenges
