Unnamed Space Idle一个简单的穷举基地布局的程序

// Warning: Some `i as usize` is hidden by steam, I cannot recover it.
#![feature(let_chains)]
use std::array;
const W:usize=6;
const H:usize=5;
fn main(){
// init map
let mut map=[[1;W];H];
map[0][4]=0;
map[1][0]=0;
map[1][5]=0;
map[2][1]=0;
map[2][4]=0;
map[3][0]=0;
map[3][5]=0;
map[4][1]=0;

// map[0][2]=0;
// map[2][2]=0;
// map[2][3]=0;
// map[4][3]=0;
// init relation
let mut rel:[[Vec<(i32,i32)>;W];H]=array::from_fn(|_|array::from_fn(|_|Vec::new()));
for i in 0..H as i32 {
for j in 0..W as i32 {
for k in -2..=2 {
for l in -2..=2 {
if ((k!=0) ^ (l!=0)) && let Some(1)=map.get((i+k) as usize).map(|x|x.get((j+l) as usize)).flatten() {
rel [][j as usize].push((i+k,j+l));
}
}
}
}
}
println!("{:?}",rel);
let mul=2.46;
let mut best=0f64;
for s in 1..36 {
for i in 0..H as i32 {
for j in 0..W as i32 {
if map[][j as usize]==1{
best=best.max(dfs(&map,&rel,&mut vec![(i,j)],s,best,mul))
}
}
}
}
}
fn dfs(map:&[[i32;W];H],rel:&[[Vec<(i32,i32)>;W];H], state:&mut Vec<(i32,i32)>,len:i32,mut score_pre:f64,scoremul:f64)->f64 {
if state.len() as i32 == len {
let mut score = map.clone().map(|x|x.map(|y|y as f64));
state.iter().for_each(|&(i,j)|score[i as usize][j as usize]=0.);
for &(i,j) in state.iter() {
for &(k,l) in rel[i as usize][j as usize].iter() {
score[k as usize][l as usize]*=scoremul;
}
}
let res=score.iter().flatten().sum::<f64>();
if res>score_pre {
println!("len {} has better score {} ",state.len(),res);
let mut m=map.clone();
state.iter().for_each(|&(i,j)|m[][j as usize]=2);
for i in m {
for j in i {
if j==0 {
print!(" ")
} else if j==1 {
print!(" . ")
} else {
print!(" ! ")
}
}
println!("");
}
}
res
} else {
let (mut i,mut j)=state.last().unwrap();
loop {
j+=1;
if j==W as i32 {
i+=1;
j=0;
}
if i<H as i32 {
if map[][j as usize]==1 {
state.push((i,j));
let res=dfs(map,rel,state,len,score_pre,scoremul);
state.pop();
if res>score_pre{
score_pre=res
}
} else {continue}
} else {
break score_pre;
}
}
}
}