讓你永遠贏得Popcap bookworm

Bookworm是個很不錯的遊戲，如果你不知道它，那麼可以在app store裡搜尋一下。我用php寫了一個永遠會拼出最高分詞彙的程序，嘿嘿，我好壞

fullwordlist.txt 就是字典，文件太長，就不貼出來了，有興趣的朋友可以上網隨便搜一個。

 字元： 

 

 
 
 
 

 

  ;
 
 
 

 

 
 

 

  ;
 
 
 

 

 

 

 佔分：

 

 
 
 
 
 

 


 

 

 

 

 


 

 

 

 

 

 


 

 

 form>






/ /作者：黃峰愛吳佳旻

if(empty($_POST)) die;

//接收並處理原始輸入數據，w代表字符，v代表分數的分數
 $data = array(); 
for($i=1;$i array_push($data, array('w' =>; strtoupper(trim($_POST[ 'w'.$i])), 'v' =>; rim($_POST['v'.$i])));
}

//去重計算求和分數
$data_unduplicated = array();
foreach ($data as $key => $value){
 $data_unduplicated[] = implode(',', $value);
}
$data_unduplicated = array_unique($data_unduplicated);
 
// 求每個字元的出現頻率
$data_Frequency = array();
foreach ($data as $arr) {
 $data_Frequency[] = $arr['w']; 
}
$data_Frequency_result = array_count_values($data_Frequency);

//將詞彙表檔案讀入資料庫
$words file('./fullwordlist.txt', FILE_IGNORE_NEW_LINES); 

// 將詞彙表全部轉成大寫英文
$words = array_map(function ($word){
 return str word);
}, $words);

//對每個單字進行頻次判斷
$result = array();
foreach ($words as $k => $ word) {
 // 遇到有'的單字，就略過
 if(strpos($word, "'") > 0) continue;

 // 對$word做字母拆解，判斷每個字母的出現頻次
 $word_arr = str_split($word);
 $word_arr_Frequency = array_count_values($word_arr);
 $pass = true;
 foreach ($comm_arr_Frequword_arr_Frequency_arr_Frequency _Frequword $character => $Frequency) {
 if(!array_key_exists($character, $data_Frequency_result) || ($data_Frequency_result[$character]  $pass = false; 🎜> }

 //篩選出的$word進行分數運算
 if($pass) {
 $word_value = 0;
 foreach ($word_arr as $wkey => $ wchar) {
 foreach($data_unduplicated as $data_item) {
 $data_item = explode(',', $data_item);
 // var_dump($data_item); 陣列0 =>字串'A ' (長度=1) 1 =>字串'3' (長度=1)
 if($wchar != $data_item[0]) continue;
 $word_value = $data_item[1];
 }
 }
 $ result[] = array('w' => $word, 'v' => $word_value);
 }
}

//最終只選出投票數最高的
$k = 0;
$highest = 0;
foreach ($result as $key => $item) {
 if(intval($item[' v']) >= $最高）{
 $highest = $item['v'];
 $k = $key;
 }
}

echo '最高分的字是：' . $result[$k]['w'] . '('.$result[$k]['v'].')';;