KiXtart Engine
KiXtart Version  = 4.50
KiXGolf Script   = kixgolf_fragmentation.kix

Computer
OS               = Windows XP Professional
CPU              =               Intel(R) Pentium(R) 4 CPU 3.20GHz
Speed            = 3192 MHz
Memory           = 1024 MB

KiXGolf Scoring Engine
Scoring Engine   = 3.0.3

KiXGolf Score
Tournament       = Fragmentation
Processing Start = 2005/10/07 19:47:30.273
Processing End   = 2005/10/07 19:47:30.820
Duration         = 0000/00/00 00:00:00.547
# Tests Run      = 180
# Tests Passed   = 180
# Tests Failed   = 0
Result           = passed
KiXGolf Score    = 292
 
Thank you for participating in KiXtart Golf!

Function F($z)
 Dim $m,$l,$i,$j,$,$s,$a,$g,$k,$v
 $m=ubound($z)
 $l=2*len(join($z,''))/($m+1)
 for $i=0 to $m
  for $j=0 to $m
   $=$z[$i]+$z[$j]
   if len($) = $l
    $s=$s+#+$
    $a=split(substr($s,2),#)
    Dim $u
    for $k=0 to ubound($a)
     if ascan($a,$,$k,1) > -1
      $u=1+$u
     endif
    next
    if $v <= $u
     $v=$u
     for $k=0 to $m
      $g=instr($,$z[$k])
     next
     if $g
      $f=$
EndFunction

KiXtart Engine
KiXtart Version     = 4.50 (WKIX32.EXE)
KiXforms Version    = 2.46.29.0 / 3.1.17.0
KiXGolf Script      = kixgolf_fragmentation.kix

Computer
OS                  = Windows 2000 Professional
CPU                 = Intel Pentium III
Speed               = 797 MHz
Memory              = 376 MB

KiXGolf Scoring Engine
Scoring Engine      = 3.0.3

KiXGolf Score
Tournament          = Fragmentation
Processing Start    = 2005/10/08 03:48:36.088
Processing End      = 2005/10/08 03:50:08.561
Duration            = 0000/00/00 00:01:32.473
Used Processor Time = 00:01:26.664
# Tests Run         = 181
# Tests Passed      = 181
# Tests Failed      = 0
Result              = passed
KiXGolf Score       = 188

Thank you for participating in KiXtart Golf!
Press any key to continue...

Function f($u)
 dim $i,$j,$c,$x,$
   $j=ubound($u)
   while $c<$j
      $f='' $c=0 $x=$u
      for $=1 to 0^join($u,'')
	$f=$f+rnd(1)
	$=$+$j/2
      next
      for $=0 to $j
         for $i=0 to $j
	  if $i<>$ & $f=$x[$]+$x[$i]
		$c=$c+2
		$x[$i]=0
		$x[$]=0
Endfunction

Function f($u)
 dim $i,$j,$c,$x,$
   $j=ubound($u)
   while $c<$j
      $f='' $c=0 $x=$u
      for $=1 to 0^join($u,'')
	$f=$f+rnd(1)
	$=$+$j/2
      next
      for $=0 to $j
         for $i=0 to $j
	  if $i<>$ & $f=$x[$]+$x[$i]
		$c=$c+2
		$x[$i]=2
		$x[$]=2
Endfunction

KiXtart Engine
KiXtart Version  = 4.51
KiXGolf Script   = kixgolf_fragmentation.kix

Computer
OS               = Windows 2000 Professional
CPU              = Intel Pentium III
Speed            = 797 MHz
Memory           = 376 MB

KiXGolf Scoring Engine
Scoring Engine   = 3.0.3

KiXGolf Score
Tournament       = Fragmentation
Processing Start = 2005/10/10 00:24:31.666
Processing End   = 2005/10/10 00:25:51.911
Duration         = 0000/00/00 00:01:20.245
# Tests Run      = 185
# Tests Passed   = 185
# Tests Failed   = 0
Result           = passed
KiXGolf Score    = 188

Thank you for participating in KiXtart Golf!
Press any key to continue...

 
function f($)
  dim $h,$c,$o,$t,$z
  $f=ubound($)
  for $c=0 to $f
      for $h=$c+1 to $f
	 $t = a+$[$c]+$[$h]
         $z = a+$[$h]+$[$c]
         if len($t)=2*len(join($))/($f+1)
              $o=$o+$t
              if $t<>$z
                $o=$o+$z
              endif
         endif
      next
   next
  for each $ in split($o,a)
    $h=ubound(split($o,$))
    if $h>$t
      $t=$h
      $f=$
endfunction
 

 
KiXtart Engine
KiXtart Version  = 4.51
KiXGolf Script   = kixgolf_fragmentation.KIX

Computer
OS               = Windows XP Professional
CPU              = AMD Athlon(tm) 64 Processor 3200+
Speed            = 2002 MHz
Memory           = 510 MB

KiXGolf Scoring Engine
Scoring Engine   = 3.0.3

KiXGolf Score
Tournament       = Fragmentation
Processing Start = 2005/10/09 18:08:36.484
Processing End   = 2005/10/09 18:08:36.718
Duration         = 0000/00/00 00:00:00.234
# Tests Run      = 185
# Tests Passed   = 185
# Tests Failed   = 0
Result           = passed
KiXGolf Score    = 241
 
Thank you for participating in KiXtart Golf!
 

Quote:

---

Public coding ends Sunday, October 9, 2005, 6pm EST

---

Function F($)

Dim $m,$i,$j,$g,$k,$l,$u,$v,$a,$s,$p

;get the number of pieces and the length of a file
$m=ubound($)
$l=2*len(join($,''))/($m+1)

;following two 'for' loops is to determine possible files
for $i=0 to $m
 for $j=0 to $m

  ;possible file contructed out of 2 pieces
  $p=$[$i]+$[$j]

  ;if length possible=length file, continue
  if len($p) = $l
   ;put the possible in a string containing all possibles
   $s=$s+','+$p
   $a=split(substr($s,2),',')

   ;check how many times possible is present in total string
   $u=0
   for $k=0 to ubound($a)
    if ascan($a,$p,$k,1) >=0
     $u=1+$u
    endif
   next

   ;if number of this possible >= previous max possible
   ;check if all pieces could be created from this possible
   if $v <= $u
    $v=$u
    $g=1
    ;here the check is preformed
    for $k=0 to $m
     if not instr($p,$[$k])
       $g=0
     endif
    next
    ;if pieces could be created, this possible is valid
    if $g
     $f=$p
    endif
   endif
  endif
 next
next

EndFunction