⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 overview.html

📁 设计一个软件的启动过程界面
💻 HTML
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<!-- saved from url=(0061)http://www.helsinki.fi/~vahaaho/KnightsTour/doc/overview.html -->
<HTML><HEAD><TITLE>Knight's Tour: Overview</TITLE>
<META http-equiv=Content-Type content="text/html; charset=iso-8859-1">
<META content="Markku V鋒鋋ho" name=Author>
<META content="MSHTML 6.00.2600.0" name=GENERATOR></HEAD>
<BODY text=#000000 vLink=#51188e aLink=#ff0000 link=#0000ef bgColor=#ffffff>
<BLOCKQUOTE><BR><BR>
  <CENTER>
  <H2>Knight's Tour (TK94KV1)</H2></CENTER>
  <CENTER><A 
  href="http://www.cs.helsinki.fi/kurssit/cum_laude/58161-5/tiralab/index.en.html">Data 
  Structures Project</A>. <A href="http://www.helsinki.fi/">University of 
  Helsinki</A>, <A href="http://www.cs.helsinki.fi/">Department of Computer 
  Science</A></CENTER>
  <P><BR><BR><BR>
  <P>The knight's tour is a puzzle that has amused chess players throughout the 
  ages. The goal of the knight is to traverse around the board, landing on each 
  square but once, and finally return to the square it started from. If the 
  board is thought of as a graph, this kind of closed path is called a 
  Hamiltonian cycle. It can be proven that there is a closed knight's tour on 
  all boards with an even number of squares and dimensions greater than four. 
  <P>The Knight's Tour applet demonstrates a simple algorithm for finding a 
  knight's tour. The idea is to always jump to the square with least exits, 
  unless it makes some unvisited squares unreachable. This algorithm works 
  surprisingly well: in the majority of cases the program chooses the right 
  moves on first try, without having to back up once. If this fails, all 
  possibilities are eventually tried in a depth-first manner. 
  <P>The program is implemented as a Java applet that can be run with any 
  browser that supports Java 1.1. The board is represented graphically, and can 
  be resized by dragging the borders with the mouse to any dimensions between 
  five and ten. The starting square can be chosen freely, and the actual search 
  process can be viewed as an animation or skipped to just see the final tour. 
  <P>Applet URL: <BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; <A 
  href="http://www.helsinki.fi/~vahaaho/KnightsTour/tour.html">http://www.helsinki.fi/~vahaaho/KnightsTour/tour.html</A> 
  <BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; <A href="../tour.html">local link</A>
  <BR>Documentation: <BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; <A 
  href="http://www.helsinki.fi/~vahaaho/KnightsTour/doc/doc.html">http://www.helsinki.fi/~vahaaho/KnightsTour/doc/doc.html</A> 
  <BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; <A 
  href="doc.html">local link</A>

  <P>Author: <BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Markku V鋒鋋ho 
  <BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; <B>tel:</B> +358-40-5604416 
  <BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; <B>email:</B> Markku.Vahaaho 
  (at) helsinki.fi <BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; <B>www:</B> <A 
  href="http://www.helsinki.fi/~vahaaho">http://www.helsinki.fi/~vahaaho</A></P></BLOCKQUOTE></BODY></HTML>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -