私は最近、Perlに書いたConwayのGame of LifeのC++コードをコピーしようとしました。しかし、C++コードの出力はPerlの出力と大きく異なります。 C++コードは完璧に動作しますが、Perlコードは奇妙な動作をします。今まで人生のゲームを見ています誰もがゲームの以下の状態が奇妙であることを確認する必要がありますPerlでのゲームのゲーム - 問題をC++から翻訳する
[][] [] [] [] [][][] [] [] [] [] [] [] [][] []
[] [] [] [] [] [] [] [][] [] [] [][] [] [] []
[] [][] [] [] [] [] [] [][][][] [] [] [][][][][] [] []
[] [][] [] [] [] [][][][] [] [] [] [] [][] []
[] [][] [] [] [][][] [] [] [] [] [][] [] []
[] [] [][][][][] [] [] [][] [][] [] [][] [] [][][] []
[] [] [] [][][] [][] [][][] [][][] [] []
[] [] [][][][][][][][][][] [][][][][] [] []
[][] [] [][][][][][][] [][][] [][] [][] []
[] [] [][][][] [] [] [] [] [][][] []
[][] [] [] [] [] [] [][] [] [][]
[] [] [][] [] [][][][] [][] [] []
[][] [] [][][][][] [][][] [][][][][][][][] [][]
[] [] [] [] [] [][][][] [][]
[][] [] [] [] [] [] [] [][][] [][][][][][][][]
[][] [] [] [] [] [] [] [][][][] [] [][] [][]
[] [][] [] [][] [] [] [][][][] [][][]
[] [][][][] [] [] [] [] [] [] [] [] [] [] [] []
[][][] [][][] [] [][] [][] [] [] [] []
[] [][][] [] [][] [][] [] [] [] [][] []
[][] [] [] [][][][][][] [][] [] [] []
[] [] [][][][][][][][][] [] [] [] [] [][][]
[][] [][][] [] [] [][] [] [] [] [][] [] [] []
[] [] [] [][] [][][][][][][] [] [][] [] [] [] []
各[]
は、生きた細胞を表し、任意の二つの白いスペースは死細胞を表しています。奇妙な部分は、コードを実行する多くの試みを通して存在する水平線と垂直線です。私はまだ予想される行動(グライダー、オシレーターなど)を見てきました。
私のコードは以下の通りです。私は助け/明確化を感謝します。前もって感謝します!
#!/usr/bin/perl
use warnings;
use strict;
use Curses;
use Time::HiRes 'usleep';
my $iterations = 100;
$iterations = $ARGV[0] if @ARGV;
initscr;
getmaxyx(my $rows, my $columns);
$columns = int($columns/2);
my ($i, $j);
my @initial_state;
foreach $i (0 .. $rows) {
foreach $j (0 .. $columns) {
$initial_state[$i][$j] = int rand(2);
}
}
my @current_state = @initial_state;
my @next_state;
my $iteration;
my ($up, $down, $right, $left);
my $adjacent_cells;
foreach $iteration (0 .. $iterations) {
foreach $i (0 .. $rows) {
foreach $j (0 .. $columns) {
$up = ($i + 1) % $rows;
$down = ($i - 1) % $rows;
$right = ($j + 1) % $columns;
$left = ($j - 1) % $columns;
$adjacent_cells = $current_state[$i][$right]
+ $current_state[$i][$left]
+ $current_state[$up][$right]
+ $current_state[$up][$left]
+ $current_state[$down][$right]
+ $current_state[$down][$left]
+ $current_state[$up][$j]
+ $current_state[$down][$j];
if ($current_state[$i][$j]) {
$next_state[$i][$j] = $adjacent_cells == 2 || $adjacent_cells == 3 ? 1 : 0;
addstr($i, 2*$j, '[]');
}
else {
$next_state[$i][$j] = $adjacent_cells == 3 ? 1 : 0;
addstr($i, 2*$j, ' ');
}
}
}
@current_state = @next_state unless $iteration == $iterations;
usleep 10000;
refresh();
}
getch();
endwin();
空のスペースに囲まれたグライダーの初期状態を構築しようとしましたか?または同様に簡単な何か?それは何をするためのものか? – spraff
@spraffはい、私はそれを試しました。私は左上の孤独なグライダーを置き、ちょうど1回の反復の後に形を変えて(非グライダーの形に)、最後まで置いていました。 –
それdef。あなたの実際の質問に対する答えではありませんが、あなたはConways Game of Lifeの[Threaded PDL](http://pdl.perl.org/?docs=Threading&title=PDL::Threading#threaded_pdl_implementation)実装を見たことがありますか? –