填充笛卡尔积，然后根据需要循环多次，并使用循环索引访问（通过模数计算）获取混洗数组中的下一个元素。
代码：（Demo）

$persons = ["Old", "Young", "Child"];
$moods = ["neutral", "happy", "sad"];
$size = 30;

$cartesianStrings = [];
foreach($persons as $p) {
    foreach($moods as $m) {
        $cartesianStrings[] = $p . ' ' . $m;
    }
}

shuffle($cartesianStrings);
$cartesianSize = count($cartesianStrings);
for ($x = 0; $x <= $size; ++$x) {
    $result[] = '|' . $cartesianStrings[$x % $cartesianSize] . '|';
}
shuffle($result);
echo implode($result);

你要做的是创建一个所有可能的输入排列的集合，然后用排列的集合填充一个所需大小的数组，然后 Shuffle 。

<?php

$person = ['Old', 'Young', 'Child'];
$moods = ['neutral', 'happy', 'sad'];

// Create a buffer for our set of combinations
$cartesianProduct = [];

// Nested loop to create the total set of combinations
foreach($person as $currPerson)
{
    foreach($moods as $currMood)
    {
        // Create string representation of the combination
        $cartesianProduct[] = $currPerson.' '.$currMood;
    }
}

// Desired size of output array
$limit = 30;

// Buffer for the final output
$output = [];

// Start at a random point and keep track of where we are in the set of possible combinations
$cartIndex = array_rand($cartesianProduct);

// Loop until we have the desired buffer size
while (sizeof($output) < $limit)
{
    // Add the current input to the output and increment the input index
    $output[] = $cartesianProduct[$cartIndex++];

    // If we have reached the end of the input buffer, reset to zero
    if ($cartIndex == sizeof($cartesianProduct))
    {
        $cartIndex = 0;
    }
}

// Randomize the output buffer
shuffle($output);

// Let's look at the results...
print_r($output);

您可以使用一个类来创建笛卡尔积，以一种更通用和更可重用的方式（并支持任意数量的输入集，而不仅仅是两个）来实现这一点。

<?php

class Cartesian
{
    public static function build($set)
    {
        if (!$set) {
            return [[]];
        }

        $subset = array_shift($set);
        $cartesianSubset = self::build($set);

        $result = [];
        foreach ($subset as $value)
        {
            foreach ($cartesianSubset as $p)
            {
                array_unshift($p, $value);
                $result[] = $p;
            }
        }

        return $result;
    }
}

// Input set - can by any number of "rows"
$input = [
    ['Old', 'Young', 'Child'],
    ['neutral', 'happy', 'sad']
];

// Build our total set of permutations
$cartesianProduct = Cartesian::build($input);

// Desired size of output array
$limit = 30;

// Buffer for the final output
$output = [];

// Start at a random point and keep track of where we are in the set of possible combinations
$cartIndex = array_rand($cartesianProduct);

// Loop until we have the desired buffer size
while (sizeof($output) < $limit)
{
    // Get the current input and increment the input index
    $currProduct = $cartesianProduct[$cartIndex++];
    
    // Add a string representation of the current entry to the output 
    $output[] = $currProduct[0].' '.$currProduct[1];

    // If we have reached the end of the input buffer, reset to zero
    if ($cartIndex == sizeof($cartesianProduct))
    {
        $cartIndex = 0;
    }
}

// Randomize the output buffer
shuffle($output);

// Let's look at the results...
print_r($output);